Classification with Finite Memory

IEEE Transactions on Information Theory

Volumn 42, Issue 2, 1996, Pages 337-347

  Wyner, Aaron D ^a   Ziv, Jacob ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Classification; Pattern matching

Indexed keywords

APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; PROBABILITY; RANDOM PROCESSES; VECTORS;

FINITE MEMORY; PATTERN MATCHING; TRAINING SEQUENCE;

CLASSIFICATION (OF INFORMATION);

EID: 0030107155     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.485707     Document Type: Article

References (4)

1. R. B. Ash, Information Theory. New York: Interscience, 1965.
2. I. Csiszàr and J. Körner, Information Theory. New York: Academic Press, 1981, eh. 1.
3. R. L. Graham and N. J. A. Sloane, "Lower bound for constant weight codes," IEEE Trans. Inform. Theory,vol. IT26, pp. 37-43, Jan. 1980.
4. A. D. Wyner and J. Ziv, "Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression," IEEE Trans. Inform. Theory,vol. 36, pp. 1250-1258, Nov. 1989.