Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime
Journal
IEEE International Symposium on Information Theory - Proceedings
Journal Volume
2020-June
Pages
491-496
Date Issued
2020
Author(s)
Abstract
Streaming codes encode a string of source packets and output a string of coded packets in real time, which eliminate the queueing delay of block coding and are thus especially suitable for delay-sensitive applications. This work studies random linear streaming codes (RLSCs) and i.i.d. packet erasure channels. While existing works focused on the asymptotic error-exponent analyses, this work characterizes the error rate in the finite memory length regime and the contributions include: (i) A new information-debt-based description of the error event; (ii) A matrix-based characterization of the error rate; (iii) A closed-form approximation of the error rate that is provably tight for large memory lengths; and (iv) A new Markov-chainbased analysis framework, which can be of independent research interest. Numerical results show that the approximation, i.e. (iii), closely matches the exact error rate even for small memory length (≈ 20). The results can be viewed as a sequential- coding counterpart of the finite length analysis of block coding [Polyanskiy et al. 10] under the specialized setting of RLSCs. © 2020 IEEE.
Other Subjects
Codes (symbols); Network coding; Analysis frameworks; Asymptotic error exponents; Closed form approximations; Delay-sensitive applications; Error rate analysis; Finite length analysis; Independent research; Packet erasure channels; Errors
Type
conference paper