On Field Size and Success Probability in Network Coding

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Using tools from algebraic geometry and Groebner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved estimates on the success probability of random linear network coding. These estimates take into account which monomials occur in the support of the determinant of the product of Edmonds matrices. Therefore we finally investigate which monomials can occur in the determinant of the Edmonds matrix.
16 pages, 3 figures, 2 tables. Accepted for publication at International Workshop on the Arithmetic of Finite Fields, WAIFI 2008

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/168264

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0806.4510
 http://arxiv.org/abs/0806.4510
 Proceedings of the 2nd International Workshop on the Arithmetic of Finite Fields, WAIFI 2008, pp. 157-173
 doi:10.1007/978-3-540-69499-1_14

Collections

arXiv