Error exponents of erasure/list decoding revisited via moments of distance enumerators

IEEE Transactions on Information Theory

Volumn 54, Issue 10, 2008, Pages 4439-4447

  Merhav, Neri ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Channel coding; Decoding; Distance enumerator; Distance measurement; Encoding; Entropy; Equations; Erasure; Error exponent; List; Optimization; Random coding

Indexed keywords

EID: 54749118629     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.929004     Document Type: Article

References (17)

1. R. Ahlswede, N. Cai, and Z. Zhang, "Erasure, list, and detection zero-error capacities for low noise and a relation to identification," IEEE Trans. Inf. Theory, vol. 42, no. 1, pp. 55-62, Jan. 1996.
2. A. Barg and G. D. Forney, Jr, "Random codes: Minimum distances and error exponents," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2568-2573, Sep. 2002.
3. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
4. B. Derrida, "The random energy model," Phys. Repts. (Review Section of Phys. Lett.), vol. 67, no. 1, pp. 29-35, 1980.
5. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
6. G. D. Forney, Jr, "Exponential error bounds for erasure, list, and decision feedback schemes," IEEE Trans. Inf. Theory, vol. IT-14, no. 2, pp. 206-220, Mar. 1968.
7. R. Etkin, N. Merhav, and E. Ordentlich, "Error exponents for the interference channel," in Proc. IEEE Int. Sump. Information Theory (ISIT 2008), Toronto, ON, Canada, Jul. 2008, pp. 1523-1527.
8. T. Hashimoto, "Composite scheme LR + Th for decoding with erasures and its effective equivalence to Forney's rule," IEEE Trans. Inf. Theory, vol. 45, no. 1, pp. 78-93, Jan. 1999.
9. T. Hashimoto and M. Taguchi, "Performance and explicit error detection and threshold decision in decoding with erasures," IEEE Trans. Inf. Theory, vol. 43, no. 5, pp. 1650-1655, Sep. 1997.
10. Y. Kaspi and N. Merhav, Error Exponents for Degraded Broadcast Channels Using Statistics of Distance Enumerators, in preparation.
11. P. Kumar, Y.-H. Nam, and H. El Gamal, "On the error exponents of arq channels with deadlines," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4265-4273, Nov. 2007.
12. N. Merhav, "Relations between random coding exponents and the statistical physics of random codes," IEEE Trans. Inf. Theory [Online]. Available: http://www.ee.technion.ac.il/people/merhav/papers/ p117.pdf., submitted for publication
13. N. Merhav, Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators, [Online]. Available: http://arxiv.org/ PS_cache/arxiv/pdf/0711/0711.2501vl.pdf
14. N. Merhav and M. Feder, "Minimax universal decoding with an erasure option," IEEE Trans. Inf. Theory, vol. 53, no. 5, pp. 1664-1675, May 2007.
15. M. Mézard and A. Montanari, Constraint Satisfaction Networks in Physics and Computation, 2006 [Online]. Available: http:// www.stanford.edu/~montanar/BOOK/book.html, draft
16. P. Ruján, "Finite temperature error-correcting codes," Phys. Rev. Lett., vol. 70, no. 19, pp. 2968-2971, May 1993.
17. A. J. Viterbi, "Error bounds for the white Gaussian and other very noisy memoryless channels with generalized decision regions," IEEE Trans. Inf. Theory, vol. IT-15, no. 2, pp. 279-287, Mar. 1969.