Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures

DOI10.1109/TIT.2020.2983152MaRDI QIDQ5124472zbMATH OpenOpenAlexFDO

Authors M. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar

Publication date 29 September 2020

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

Full work available at URL https://doi.org/10.1109/tit.2020.2983152

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Cited in

(6)

• Optimal erasure protection assignment for scalable compressed data with small channel packets and short channel codewords
• Real-time error correction codes for deletable errors
• Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels
• Streaming Codes for Variable-Size Messages
• Unequal Error Protection for Streaming Media Based on Rateless Codes
• Comments on "Optimal Erasure Protection for Scalably Compressed Video Streams With Limited Retransmission

This page was built for publication: Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures

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