Technical Program

Paper Detail

Paper Title A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures
Paper IdentifierTU2.R1.4
Authors Nikhil Krishnan Muralee Krishnan, Deeptanshu Shukla, Indian Institute of Science, India; P. Vijay Kumar, Indian Institute of Science Bangalore, India and University of Southern California, United States
Session Jack Keil Wolf Award
Location Le Théatre (Parterre), Level -1
Session Time Tuesday, 09 July, 11:40 - 13:00
Presentation Time Tuesday, 09 July, 12:40 - 13:00
Manuscript  Click here to download the manuscript
Abstract We study the problem of designing error-correcting codes over channels with burst and random erasures, when a strict decoding delay constraint $\tau$ is in place. Badr et al. introduced a channel model wherein for any sliding-window of width $w$, at most one of the following erasures patterns are permissible; (i) a burst erasure of length $\leq b$ or (ii) a total of $\leq a$ random erasures. We present a rate-optimal code construction under this model, which covers all feasible channel and delay parameters. In contrast to existing rate-optimal code families which require a field-size at least as large as $O({\tau \choose a})$, our construction needs a field-size quadratic in the decoding delay constraint. For some parameters, the construction can be over linear field-size.