Universal Decoding for Memory less Gaussian Channels with a Deterministic Interference

IEEE Transactions on Information Theory

Volumn 39, Issue 4, 1993, Pages 1261-1269

  Merhav, Neri ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Gaussian channels; maximum mutual informa; random coding exponent; tion; Universal decoding

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; CODES (SYMBOLS); CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); FINITE AUTOMATA; INTERSYMBOL INTERFERENCE; PARAMETER ESTIMATION; RANDOM PROCESSES; VECTORS; WHITE NOISE;

EUCLIDEAN SPHERE; MAXIMUM MUTUAL INFORMATION; MEMORYLESS GAUSSIAN CHANNELS; RANDOM CODING EXPONENT; UNIVERSAL DECODING;

DECODING;

EID: 0027629235     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.243443     Document Type: Article

References (7)

1. V. D. Goppa, “Nonprobabilistic mutual information without memory,” Probl. Contr. Inform. Theory, vol. 4, pp. 97–102, 1975.
2. I. Csiszár and J. Körner Information Theory: Coding Theorems for Discrete Memory less Systems. New York: Academic, 1981.
3. J. Ziv, “Universal decoding for finite-state channels,” IEEE Trans. Inform. Theory, vol. IT-31, no. 4, pp. 453–460, July 1985.
4. J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 530–536, Sept. 1978.
5. S. U. H. Qureshi, “Adaptive equalization,” Proc. IEEE, vol. 73, pp. 1349–1387, Sept. 1985.
6. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley 1968.
7. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.