Computer Science – Information Theory
Scientific paper
2008-06-27
Proceedings of the 2nd International Workshop on the Arithmetic of Finite Fields, WAIFI 2008, pp. 157-173
Computer Science
Information Theory
16 pages, 3 figures, 2 tables. Accepted for publication at International Workshop on the Arithmetic of Finite Fields, WAIFI 20
Scientific paper
10.1007/978-3-540-69499-1_14
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.
Geil Olav
Matsumoto Ryutaroh
Thomsen Casper
No associations
LandOfFree
On Field Size and Success Probability in Network Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Field Size and Success Probability in Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Field Size and Success Probability in Network Coding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-692974