Exact random coding exponents for erasure decoding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 260-264

  Baruch, Anelia Somekh ^a   Merhav, Neri ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS TECHNIQUES; BINARY SYMMETRIC CHANNEL; DECODING ERRORS; ERASURE DECODING; ERROR EXPONENT; EXPLICIT EXPRESSIONS; LARGE DEVIATIONS; LOWER BOUNDS; NUMERICAL CALCULATION; RANDOM CODING; RANDOM CODING EXPONENT; THRESHOLD PARAMETERS; TWO PARAMETER; Z-CHANNELS;

DECODING; INFORMATION THEORY;

ERROR CORRECTION;

EID: 77955667013     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513317     Document Type: Conference Paper

References (16)

1. G. D. Forney, Jr, "Exponential error bounds for erasure, list, and decision feedback schemes," IEEE Trans. Inform. Theory, vol. IT-14, no. 2, pp. 206-220, Mar. 1968.
2. R. Ahlswede, N. Cai, and Z. Zhang, "Erasure, list, and detection zeroerror capacities for low noise and a relation to identication," IEEE Trans. Inform. Theory, vol. 42, no. 1, pp. 55-62, Jan. 1996.
3. T. Hashimoto, Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forneys rule, IEEE Trans. Inform. Theory, vol. 45, no. 1, pp. 78-93, Jan. 1999.
4. T. Hashimoto and M. Taguchi, Performance and explicit error detection and threshold decision in decoding with erasures, IEEE Trans. Inform. Theory, vol. 43, no. 5, pp. 1650-1655, Sep. 1997.
5. P. Kumar, Y.-H. Nam, and H. El Gamal, On the error exponents of arq channels with deadlines, IEEE Trans. Inform. Theory, vol. 53, no. 11, pp. 4265-4273, Nov. 2007.
6. N. Merhav and M. Feder, Minimax universal decoding with an erasure option, IEEE Trans. Inform. Theory, vol. 53, no. 5, pp. 1664-1675, May 2007.
7. A. J. Viterbi, Error bounds for the white Gaussian and other very noisy memoryless channels with generalized decision regions, IEEE Trans. Inform. Theory, vol. IT-15, no. 2, pp. 279-287, Mar. 1969.
8. M. Mézard and A. Montanari, Information, Physics, and Computation, Oxford University Press, 2009.
9. N. Merhav, "Error exponents of erasure/list decoding revisited via moments of distance enumerators," IEEE Trans. Inform. Theory, vol. 54, no. 10, pp. 4439-4447, Oct. 2008.
10. N. Merhav, "Relations between random coding exponents and the statistical physics of random codes," IEEE Trans. Inform. Theory, vol. 55, no. 1, pp. 83-92, Jan. 2009.
11. N. Merhav, "The generalized random energy model and its application to the statistical physics of ensembles of hierarchical codes," IEEE Trans. Inform. Theory, vol. 55, no. 3, pp. 1250-1268, Mar. 2009.
12. R. Etkin, N. Merhav and E. Ordentlich, "Error exponents of optimum decoding for the interference channel," IEEE Trans. Inform. Theory, vol. 56 no. 1 pp. 40-56, Jan. 2010.
13. Y. Kaspi and N. Merhav, "Error exponents for broadcast channels with degraded message sets," submitted to IEEE Trans. Inform. Theory, May 2009.
14. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
15. A. Somekh-Baruch and N. Merhav, "Achievable error exponents for the private fingerprinting game," vol. 53, no. 5, pp. 1827-1838, May 2007.
16. A. Somekh-Baruch and N. Merhav, "Exact random coding exponents for erasure decoding," in preparation, Jan. 2010.