A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures

Krishnan, MN and Shukla, D and Kumar, PV (2019) A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures. In: 2019 IEEE International Symposium on Information Theory, ISIT 2019, 7 July 2019 - 2 July 2019, Paris, pp. 852-856.

PDF ISIT _2019.pdf - Published Version Restricted to Registered users only Download (2MB) | Request a copy

Abstract

We study the problem of designing error-correcting codes over channels with burst and random erasures, when a strict decoding delay constraint τ 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 ≤ b or (ii) a total of ≤ 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\left( {\binom {\tau} {a} } \right), our construction needs a field-size quadratic in the decoding delay constraint. For some parameters, the construction can be over linear field-size.

Item Type:	Conference Paper
Publication:	IEEE International Symposium on Information Theory - Proceedings
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords:	Decoding, Channel model; Decoding delay; Delay parameters; Error correcting code; Field size; Optimal codes; Quadratic fields; Sliding Window, Optimal systems
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	19 Dec 2022 07:00
Last Modified:	19 Dec 2022 07:00
URI:	https://eprints.iisc.ac.in/id/eprint/78499

Actions (login required)

View Item