Universal Random Access Error Exponents for Codebooks of Different Word-Lengths
Information Theory
2017-01-24 v3 math.IT
Abstract
Csisz\'ar's channel coding theorem for multiple codebooks is generalized allowing the codeword lenghts differ across codebooks. Also in this case, for each codebook an error exponent can be achieved that equals the random coding exponent for this codebook alone, in addition, erasure detection failure probability tends to 0. This is proved even for sender and receiver not knowing the channel. As a corollary, a substantial improvement is obtained when the sender knows the channel.
Cite
@article{arxiv.1607.01935,
title = {Universal Random Access Error Exponents for Codebooks of Different Word-Lengths},
author = {Lóránt Farkas and Tamás Kói},
journal= {arXiv preprint arXiv:1607.01935},
year = {2017}
}
Comments
This paper is submitted to IEEE Transactions on Information Theory. It was presented in part at the recent result poster session of ISIT 2016, Barcelona