Code rate, queueing behavior and the correlated erasure channel

Published

Conference Paper

This paper considers the relationship between coderate selection and queueing performance for communication systems with time-varying parameters. While error-correcting codes offer protection against channel unreliability, there is a tradeoff between the enhanced protection of low-rate codes and the increased information transfer of high-rate codes. Hence, there exists a natural compromise between packet-level error protection and information rate. In the limiting regime where codewords are asymptotically long, this tradeoff is well-understood and characterized by the Shannon capacity. However, for delay-sensitive communication systems and finite code-lengths, a complete characterization of this tradeoff is still not fully developed. This paper offers a new perspective on the queueing performance of communication systems with finite block-lengths operating over correlated erasure channels. A rigorous framework that links code rate to overall system performance for random codes is presented. Guidelines for code rate selection in delay-sensitive systems are identified.

Full Text

Duke Authors

Cited Authors

  • Parag, P; Chamberland, JF; Pfister, H; Narayanan, K

Published Date

  • July 27, 2010

Published In

  • Ieee Information Theory Workshop 2010, Itw 2010

International Standard Book Number 13 (ISBN-13)

  • 9781424463725

Digital Object Identifier (DOI)

  • 10.1109/ITWKSPS.2010.5503186

Citation Source

  • Scopus