Simplistic universal coding
Authors:
- D.L. NeuhoffDND.L. Neuhoff
- P.C. ShieldsPSP.C. Shields
- 1 March 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (2) , 778-781
Abstract
. A conceptually simple coding method may bedescribed as follows. The source sequence is parsed into fixedlength blocks and a list of these blocks is placed in a dictionary.In the lossless case, the dictionary is transmitted and each successiveblock is encoded by giving its dictionary location. In thelossy case, the smallest collection of blocks such that every memberof the dictionary is within distortion ffi of the collection isdetermined, this codebook is transmitted, and each...Keywords
This publication has 11 references indexed in Scilit:
- A survey of the theory of source coding with a fidelity criterionIEEE Transactions on Information Theory, 1993
- How Sampling Reveals a ProcessThe Annals of Probability, 1990
- Universal Almost Sure Data CompressionThe Annals of Probability, 1990
- Universal data compression and repetition timesIEEE Transactions on Information Theory, 1989
- Interval and recency rank source coding: Two on-line adaptive variable-length schemesIEEE Transactions on Information Theory, 1987
- Fixed rate universal block source coding with a fidelity criterionIEEE Transactions on Information Theory, 1975
- A Generalization of Ornstein's $\bar d$ Distance with Applications to Information TheoryThe Annals of Probability, 1975
- Universal noiseless codingIEEE Transactions on Information Theory, 1973
- Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterionIEEE Transactions on Information Theory, 1972
- Sequence time coding for data compressionProceedings of the IEEE, 1966