Paper Info
Title
Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime
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.
Year
DOI
Venue
2020
10.1109/ISIT44484.2020.9174038
2020 IEEE International Symposium on Information Theory (ISIT)
Keywords
DocType
ISSN
information-debt-based description,finite length analysis,block coding,error rate analysis,random linear streaming codes,finite memory length regime,queueing delay,delay-sensitive applications,packet erasure channels,asymptotic error-exponent analyses,Markov-chain based analysis framework,block coding queueing delay,sequential-coding
Conference
2157-8095
ISBN
Citations 
PageRank 
978-1-7281-6433-5
0
0.34
References 
Authors
10
5
Name
Order
Citations
PageRank
Pin-Wen Su100.34
Yu-Chih Huang215625.02
Shih-Chun Lin355453.65
I-Hsiang Wang416324.30
Chih-Chun Wang579555.20