Sparse graph codes and practical decoding algorithms for communicating over packet timings in networks
Todd P. Coleman, Negar Kiyavash · 2008
This paper examines more closely the probabilistic dynamics of queueing channels and discusses a new practical coding scheme which is tailored to such channels and approaches the capacity. We discuss a shaping technique to map algebraic symbols to non-uniform codewords using the inverse cumulative distribution of a target random variable. We also exploit the graphical structure of the conditional distribution of the departure process given the arrival process of a queue to develop capacity approaching codes with low-complexity decoding algorithms.