Computer Science – Information Theory
Scientific paper
2009-03-25
Computer Science
Information Theory
33 pages, 1 figures
Scientific paper
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 trade off 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 we present a proof of the fact that the optimal trade off between error exponents of a two message code does not increase with feedback on DMCs.
Nakiboglu Baris
Zheng Lizhong
No associations
LandOfFree
Error-and-Erasure Decoding for Block Codes with Feedback does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Error-and-Erasure Decoding for Block Codes with Feedback, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error-and-Erasure Decoding for Block Codes with Feedback will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-68684