Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal


TitleOn field size and success probability in network coding.
Author(s) Olav Geil, Ryutaroh Matsumoto, Casper Thomsen
TypeBook, Chapter in Book, Conference Proceeding
AbstractUsing tools from algebraic geometry and Gröbner 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.
KeywordsDistributed networking, linear network coding, multicast
URL http://link.springer.com/chapter/10.1007%2F978-3-540-69499-1_14
PublisherBerlin: Springer
Translation No
Refereed No