Universal sequential decoding

1998 Information Theory Workshop, ITW 1998

Volumn , Issue , 1998, Pages 58-

  Lapidoth, A ^a   Ziv, J ^b  

^a USA   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; INFORMATION THEORY; VITERBI ALGORITHM;

ASYMPTOTIC COMPLEXITY; DISCRETE MEMORYLESS CHANNELS; FINITE STATE CHANNELS; INPUT DISTRIBUTIONS; PERFORMANCE TRADE-OFF; SEQUENTIAL DECODING; UNIVERSAL DECODING; UNKNOWN CHANNEL;

ALGORITHMS;

EID: 84938852322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.1998.706427     Document Type: Conference Paper

References (5)

1. I. Csiszhr and J. Korner, Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, 1981.
2. M. Feder and A. Lapidoth, "Universal decoding for channels with memory," to appear in IEEE Tkans. on Inform. Theory.
3. A. Lapidoth and J. Ziv, "On the universality of the LZ-based decoding algorithm", To appear in IEEE Trans. on Inform. Theory.
4. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding, McGraw-Hill, 1979.
5. J. Ziv, "Universal decoding for finite-state channels," IEEE Tkans. on Inform. Theory., vol. 31, pp. 453-460, July 1985.