On Field Size and Success Probability in Network Coding

DOI10.1007/978-3-540-69499-1_14MaRDI QIDQ3519560zbMATH OpenOpenAlexWikidataFDO

Authors Olav Geil, Ryutaroh Matsumoto, Casper Thomsen

Publication date 19 August 2008

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.4510

zbMATH Keywords

distributed networkinglinear network codingmulticastnetwork codingrandom network coding

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Circuits, networks (94C99)

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.

Recommendations

• Deterministic network coding by matrix completion
• Exact decoding probability of random linear network coding for combinatorial networks
• Aspects of Random Network Coding
• Coding for Errors and Erasures in Random Network Coding
• A Random Linear Network Coding Approach to Multicast

Cites work

• A Random Linear Network Coding Approach to Multicast
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• scientific article; zbMATH DE number 967945 (Why is no real title available?)
• Linear network coding
• Network information flow
• On codes from norm-trace curves

Cited in

(1)

• Multicast triangular semilattice network

This page was built for publication: On Field Size and Success Probability in Network Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519560)