Universal Random Access Error Exponents for Codebooks of Different Blocklengths

DOI10.1109/TIT.2017.2784369zbMATH Open1390.94679OpenAlexW2778909300MaRDI QIDQ4569178FDOQ4569178

Authors Lóránt Farkas, Tamás Kói

Publication date 27 June 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.01935

Mathematics Subject Classification ID

Source coding (94A29)

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.

This page was built for publication: Universal Random Access Error Exponents for Codebooks of Different Blocklengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569178)