On Field Size and Success Probability in Network Coding

DOI10.1007/978-3-540-69499-1_14zbMath1247.94060arXiv0806.4510OpenAlexW2158752656WikidataQ57735106 ScholiaQ57735106MaRDI QIDQ3519560

Casper Thomsen, Olav Geil, Ryutaroh Matsumoto

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

multicastlinear network codingnetwork codingrandom network codingdistributed networking

Mathematics Subject Classification ID

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

Related Items (1)

Multicast triangular semilattice network

Cites Work

• Unnamed Item
• Unnamed Item
• On codes from norm-trace curves
• A Random Linear Network Coding Approach to Multicast
• Network information flow
• Linear network coding

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