On Field Size and Success Probability in Network Coding

Simple item page
dc.creatorGeil, Olav
dc.creatorMatsumoto, Ryutaroh
dc.creatorThomsen, Casper
dc.date2008-06-27
dc.date.accessioned2026-07-07T10:00:11Z
dc.date.available2026-07-07T10:00:11Z
dc.descriptionUsing 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.
dc.description16 pages, 3 figures, 2 tables. Accepted for publication at International Workshop on the Arithmetic of Finite Fields, WAIFI 2008
dc.identifierhttps://arxiv.org/abs/0806.4510
dc.identifierhttp://arxiv.org/abs/0806.4510
dc.identifierProceedings of the 2nd International Workshop on the Arithmetic of Finite Fields, WAIFI 2008, pp. 157-173
dc.identifierdoi:10.1007/978-3-540-69499-1_14
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168264
dc.subjectInformation Theory
dc.titleOn Field Size and Success Probability in Network Coding
dc.typetext

Files

Collections

arXiv