Universal Random Access Error Exponents for Codebooks of Different Blocklengths
From MaRDI portal
Publication:4569178
DOI10.1109/TIT.2017.2784369zbMATH Open1390.94679arXiv1607.01935OpenAlexW2778909300MaRDI 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)
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.
Full work available at URL: https://arxiv.org/abs/1607.01935
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)
