Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:0806.4510 (cs)
[Submitted on 27 Jun 2008]

Title:On Field Size and Success Probability in Network Coding

Authors:Olav Geil, Ryutaroh Matsumoto, Casper Thomsen
View PDF
Abstract: 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.
Comments: 16 pages, 3 figures, 2 tables. Accepted for publication at International Workshop on the Arithmetic of Finite Fields, WAIFI 2008
Subjects: Information Theory (cs.IT)
Cite as: arXiv:0806.4510 [cs.IT]
  (or arXiv:0806.4510v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.0806.4510
Journal reference: Proceedings of the 2nd International Workshop on the Arithmetic of Finite Fields, WAIFI 2008, pp. 157-173
Related DOI: https://doi.org/10.1007/978-3-540-69499-1_14

Submission history

From: Casper Thomsen [view email]
[v1] Fri, 27 Jun 2008 13:05:32 UTC (15 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2008-06
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Olav Geil
Ryutaroh Matsumoto
Casper Thomsen
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)