Layered Constructions for Low-Delay Streaming Codes

DOI10.1109/TIT.2016.2618924zbMATH Open1359.94782arXiv1308.3827OpenAlexW2125921054MaRDI QIDQ2979084FDOQ2979084

Authors: Ahmed Z. Badr, Pratik Patil, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos 

Publication date: 2 May 2017

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

Abstract: We propose a new class of error correction codes for low-delay streaming communication. We consider an online setup where a source packet arrives at the encoder every $M$ channel uses, and needs to be decoded with a maximum delay of $T$ packets. We consider a sliding-window erasure channel --- $cC(N,B,W)$ --- which introduces either up to $N$ erasures in arbitrary positions, or $B$ erasures in a single burst, in any window of length $W$. When $M=1$, the case where source-arrival and channel-transmission rates are equal, we propose a class of codes --- MiDAS codes --- that achieve a near optimal rate. Our construction is based on a {em layered} approach. We first construct an optimal code for the $cC(N=1,B,W)$ channel, and then concatenate an additional layer of parity-check symbols to deal with $N>1$. When $M>1$, the case where source-arrival and channel-transmission rates are unequal, we characterize the capacity when $N=1$ and $WgeM(T+1),$ and for $N>1$, we propose a construction based on a layered approach. Numerical simulations over Gilbert-Elliott and Fritchman channel models indicate significant gains in the residual loss probability over baseline schemes. We also discuss the connection between the error correction properties of the MiDAS codes and their underlying column distance and column span.

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

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cited In (7)

• Block Toeplitz matrices for burst-correcting convolutional codes
• A new rank metric for convolutional codes
• Weighted Reed–Solomon convolutional codes
• List decoding of convolutional codes over integer residue rings
• Efficient error-correcting codes for sliding windows
• Streaming Codes for Variable-Size Messages
• Concatenation of convolutional codes and rank metric codes for multi-shot network coding

This page was built for publication: Layered Constructions for Low-Delay Streaming Codes

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