Nearest neighbor decoding for additive non-Gaussian noise channels

IEEE Transactions on Information Theory

Volumn 42, Issue 5, 1996, Pages 1520-1529

  Lapidoth, Amos ^a,b  

^a IEEE

^b USA   (United States)

Author keywords

Euclidean distance; Fading; Generalized cutoff rate; Mismatched decoding; Multiple access channel; Nearest neighbor decoding

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CONVERGENCE OF NUMERICAL METHODS; ERRORS; FADING (RADIO); PROBABILITY; RANDOM PROCESSES; SIGNAL RECEIVERS; SPURIOUS SIGNAL NOISE; TRANSMITTERS;

EUCLIDEAN DISTANCE; GENERALIZED CUTOFF RATE; MISMATCHED DECODING; MULTIPLE ACCESS CHANNEL; NEAREST NEIGHBOR DECODING;

DECODING;

EID: 0030242242     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.532892     Document Type: Article

References (19)

1. I. Csiszár and J. Körner, "Graph decomposition: A new key to coding theorems," IEEE Trans. Inform. Theory, vol. IT-27, no. 9, pp 5-12, Jan. 1981.
2. J. Y. N. Hui, "Fundamental issues of multiple accessing," Ph.D. dissertation. Massachusetts Institute of Technology, Cambridge, MA, 1983.
3. V. B. Balakirsky, "Coding theorem for discrete memory less channels with given decision rules," in Proc. 1st French-Soviet Workshop on Algebraic Coding, G. Choen, S. Litsyn, A. Lobstein, and G. Zémor, Eds. (Lecture Notes in Computer Science, vol. 573). Berlin. Germany: Springer-Verlag, July 1991, pp. 142-150.
4. [41 _, "A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels," IEEE Trans. Inform. Theory, vol. 41, no. 6, pp. 1889-1902, Nov. 1995.
5. N. Merhav, G. Kaplan, A Lapidoth, and S. Shamai (Shitz), "On information rates for mismatched decoders," IEEE Trans, Inform. Theory., vol. 40, no. 6, pp. 1953-1967, Nov. 1994.
6. A. Lapidoth, "Mismatched decoding and the multiple-access channel," this issue, pp. 1439-1452.
7. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
8. T. G. Thomas and B. Hughes, "Exponential error bounds for random codes on Gaussian arbitrarily varying channels," IEEE Trans. Inform. Theory, vol. 37, no. 3, pp. 643-649, May 1991.
9. B. Hughes and M. Mizlan, "An asymptotically optimal random modem and detector for robust communication," IEEE Trans. Inform. Theory, vol. 36, no. 4, pp. 810-821, July 1990.
10. B. Hughes and P. Narayan, "Gaussian arbitrary varying channels," IEEE Trans. Inform. Theory, vol. IT-33, no. 2, pp. 267-284, Mar. 1987.
11. I. Csiszár and P. Narayan, ''Capacity of the Gaussian arbitarily varying channel," IEEE Trans. Inform. Theory, vol. 37, no. 1, pp. 18-26, Jan. 1991.
12. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.
13. J. Ziv, "Universal decoding for finite-state channels," IEEE Trans. Inform. Theory, vol. IT-31, no. 4, pp. 453-4-60, July 1985.
14. A. Lapidoth, "On the role of mismatch in rate distortion theory," IEEE Trans. Inform. Theory, to be published.
15. J. K. Omura and B. K. Levitt, "Coded error probability evaluation for antijam communication systems," IEEE Trans. Commun., vol. COM-30, pp. 896-903, May 1982.
16. R. J. McEliece and W. E. Stark, "Channels with block interference," IEEE Trans. Inform. Theory, vol. IT-30, pp. 44-53, Jan. 1984.
17. A. Lapidoth, "On information rates for mismatched decoders," in Proc. 2nd Int. Winter Meeting on Coding and Information Theory, A. J. Han Vinck, Eds. (Institut für Experimentelle Mathematik, Universität GH Essen, Ellernstraße 29, 45326 Essen, Germany, Dec. 12-15, 1993), p. 26: preprint no. 23.
18. I. Csiszár and P. Narayan, "Channel capacity for a given decoding metric," IEEE Trans. Inform. Theory, vol. 41, no. 1, pp. 35-4-3, Jan. 1995.
19. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications. Jones and Bartlett Publishers, 1993.