Streaming Codes for Multicast Over Burst Erasure Channels

DOI10.1109/TIT.2015.2445753MaRDI QIDQ2977325zbMATH OpenOpenAlexFDO

Authors Ahmed Z. Badr, Devin Lui, Ashish Khisti

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Burst-correcting codes (94B20) Other types of codes (94B60)

Abstract: We study the capacity limits of real-time streaming over burst-erasure channels. A stream of source packets must be sequentially encoded and the resulting channel packets must be transmitted over a two-receiver burst-erasure broadcast channel. The source packets must be sequentially reconstructed at each receiver with a possibly different reconstruction deadline. We study the associated capacity as a function of burst-lengths and delays at the two receivers. We establish that the operation of the system can be divided into two main regimes: a low-delay regime and a large-delay regime. We fully characterize the capacity in the large delay regime. The key to this characterization is an inherent slackness in the delay of one of the receivers. At every point in this regime we can reduce the delay of at-least one of the users until a certain critical value and thus it suffices to obtain code constructions for certain critical delays. We partially characterize the capacity in the low-delay regime. Our capacity results involve code constructions and converse techniques that appear to be novel. We also provide a rigorous information theoretic converse theorem in the point-to-point setting which was studied by Martinian in an earlier work.

Cited in

(9)

• Concatenation of convolutional codes and rank metric codes for multi-shot network coding
• Systematic maximum sum rank codes
• A new rank metric for convolutional codes
• Block Toeplitz matrices for burst-correcting convolutional codes
• List decoding of convolutional codes over integer residue rings
• Streaming Codes for Variable-Size Messages
• Efficient error-correcting codes for sliding windows
• Unequal Error Protection for Streaming Media Based on Rateless Codes
• On the construction of MRD convolutional codes

This page was built for publication: Streaming Codes for Multicast Over Burst Erasure Channels

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