Universal rateless coding with finite message set

Abstract

Universal rateless coding over unknown discrete memoryless channels (DMC) is considered. In rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level of the decoder. This work considers the finite message set case where a finite number of bits are transmitted over an unknown discrete memoryless channel, with a… (More)
DOI: 10.1109/ISIT.2012.6283583

Topics

  • Presentations referencing similar topics