Errors-and-Erasures Decoding for Block Codes With Feedback
Name
Zheng_Errors-and-erasures.pdf
Size
482.22 KB
Format
Adobe PDF
Checksum (MD5)
ac41de192d502cdb2156d7e5fa78a267
Author(s)
Nakiboglu, Baris
Zheng, Lizhong
Date Issued
January 2012
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Nakiboglu, Baris, and Lizhong Zheng. “Errors-and-Erasures Decoding for Block Codes With Feedback.” IEEE Transactions on Information Theory 58.1 (2012): 24–49.
Version
Author's final manuscript
Abstract
Inner and outer bounds are derived on the optimal performance of fixed-length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First, an inner bound is derived using a two-phase encoding scheme with communication and control phases together with the optimal decoding rule for the given encoding scheme, among decoding rules that can be represented in terms of pairwise comparisons between the messages. Then, an outer bound is derived using a generalization of the straight-line bound to errors-and-erasures decoders and the optimal error-exponent tradeoff of a feedback encoder with two messages. In addition, upper and lower bounds are derived, for the optimal erasure exponent of error-free block codes in terms of the rate. Finally, a proof is provided for the fact that the optimal tradeoff between error exponents of a two-message code does not improve with feedback on discrete memoryless channels (DMCs).
Description
September 1, 2011
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tit.2011.2169529
