Aspects of Random Network Coding

DOI10.1142/9789814335768_0002MaRDI QIDQ3461810zbMATH OpenOpenAlexFDO

Authors Olav Geil, Casper Thomsen

Publication date 18 January 2016

Published in Algebraic Geometry Modeling in Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814335768_0002

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Applications of graph theory to circuits and networks (94C15) Circuits, networks (94C99)

Recommendations

• Random network coding over composite fields
• Decoding of random network codes
• A computational perspective on network coding
• Partial spreads in random network coding
• Network Coding: A Computational Perspective
• The encoding complexity of network coding
• A Random Linear Network Coding Approach to Multicast
• Randomized and deterministic algorithms for network coding problems in wireless networks
• Coding for Errors and Erasures in Random Network Coding

Cited in

(4)

• Hybrid Noncoherent Network Coding
• On Field Size and Success Probability in Network Coding
• A Random Linear Network Coding Approach to Multicast
• Decoding of random network codes

This page was built for publication: Aspects of Random Network Coding

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