Stable Throughput for Multicast With Random Linear Coding

DOI10.1109/TIT.2010.2090214MaRDI QIDQ5281125zbMATH OpenFDO

Authors Randy Cogill, Brooke Shrader, Anthony Ephremides

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2010.2090214

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Source coding (94A29) Linear codes (general theory) (94B05)

Cited in

(4)

• Multicasting in Linear Deterministic Relay Network by Matrix Completion
• A Random Linear Network Coding Approach to Multicast
• A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks
• Tight bounds for FEC-based reliable multicast

This page was built for publication: Stable Throughput for Multicast With Random Linear Coding

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