Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures

Krishnan, M Nikhil and Kumar, P Vijay (2018) Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 1809-1813.

PDF ISIT_1809_2018.pdf - Published Version Restricted to Registered users only Download (526kB) | Request a copy

Abstract

Recovery of data packets from packet erasures in a timely manner is critical for many streaming applications. An early paper by Martinian and Sundberg introduced a framework for streaming codes and designed rate-optimal codes that permit delay-constrained recovery from an erasure burst of length up to B. A recent work by Badr et al. extended this result and introduced a sliding-window channel model C(N, B, W). Under this model, in a sliding-window of width W, one of the following erasure patterns are possible (i) a burst of length at most B or (ii) at most N (possibly non-contiguous) arbitrary erasures. Badr et al. obtained a rate upper bound for streaming codes that can recover with a time delay T, from any erasure patterns permissible under the C(N, B, W) model. However, constructions matching the bound were absent, except for a few parameter sets. In this paper, we present a family of codes that achieves the rate upper bound for all feasible parameters N, B, W and T.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belong to IEEE
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	24 Nov 2018 14:29
Last Modified:	24 Nov 2018 14:29
URI:	http://eprints.iisc.ac.in/id/eprint/61136

Actions (login required)

View Item