2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | C.9.3 | ||
| Paper Title | Staggered Diagonal Embedding Based Linear Field Size Streaming Codes | ||
| Authors | Vinayak Ramkumar, Myna Vajha, Indian Institute of Science, India; M. Nikhil Krishnan, University of Toronto, India; P. Vijay Kumar, Indian Institute of Science, India | ||
| Session | C.9: Streaming Codes | ||
| Presentation | Lecture | ||
| Track | Coding for Communications | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | An $(a,b,\tau)$ streaming code is a packet-level erasure code that can recover under a strict delay constraint of $\tau$ time units, from either a burst of $b$ erasures or else of $a$ random erasures, occurring within a sliding window of time duration $w$. While rate-optimal constructions of such streaming codes are available for all parameters $\{a,b,\tau,w\}$ in the literature, they require in most instances, a quadratic, $O(\tau^2)$ field size. In this work, we make further progress towards field size reduction and present rate-optimal $O(\tau)$ field size streaming codes for two regimes: (i) $gcd(b,\tau+1-a)\ge a$ (ii) $\tau+1 \ge a+b$ and $b \mod \ a \in \{0,a-1\}$. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
