By Topic

Exact Random Coding Exponents for Erasure Decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Anelia Somekh-Baruch ; School of Engineering, Bar-Ilan University, Ramat-Gan, Israel ; Neri Merhav

Random coding of channel decoding with an erasure option is studied. By analyzing the large deviations behavior of the code ensemble, we obtain exact single-letter formulas for the error exponents in lieu of Forney's lower bounds. The analysis technique we use is based on an enhancement and specialization of tools for assessing the statistical properties of certain distance enumerators. We specialize our results to the setup of the binary symmetric channel case with uniform random coding distribution and derive an explicit expression for the error exponent which, unlike Forney's bounds, does not involve optimization over two parameters. We also establish the fact that for this setup, the difference between the exact error exponent corresponding to the probability of undetected decoding error and the exponent corresponding to the erasure event is equal to the threshold parameter. Numerical calculations indicate that for this setup, as well as for a Z-channel, Forney's bound coincides with the exact random coding exponent.

Published in:

IEEE Transactions on Information Theory  (Volume:57 ,  Issue: 10 )