On Field Size and Success Probability in Network Coding

Hans Olav Geil, Ryutaroh Matsumoto, Casper Thomsen

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

3 Citations (Scopus)

Abstract

Using 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.
Original languageEnglish
Title of host publicationArithmetic of Finite Fields : 2nd International Workshop, WAIFI 2008 Siena, Italy, July 6-9, 2008 Proceedings
PublisherSpringer
Publication date2008
Pages157-173
ISBN (Print)978-3-540-69498-4
DOIs
Publication statusPublished - 2008
EventInternational Workshop, WAIFI 2008 - Siena, Italy
Duration: 6 Jul 20089 Jul 2008
Conference number: 2

Conference

ConferenceInternational Workshop, WAIFI 2008
Number2
Country/TerritoryItaly
CitySiena
Period06/07/200809/07/2008
SeriesLecture Notes in Computer Science
Number5130
ISSN0302-8743

Fingerprint

Dive into the research topics of 'On Field Size and Success Probability in Network Coding'. Together they form a unique fingerprint.

Cite this