Abstract
A universal code is suited for many sources simultaneously. To develop such a code we need only calculate the capacity of a communication channel. Universal codes are constructed explicitly for some interesting sets of sources. Those are Bernoulli, Markov, monotone sources (probabilities of letters are ordered). There are both blockto-variable-length and variable-length-to-block universal codes. There is a sequence of codes, which is weakly universal on the set of all stationary sources (the redundancy goes to zero).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
Fitingof B.M. (1966) Optimal Encoding under an Unknown or Changing Statistics. Problems of Information Transmission, Vol. 2 (2), P. 3–11.
Kolmogorov A.N. (1965) Three Approaches to the Definition of the Concept 201Cthe Quantity of Information”. Problems of Information Transmission, Vol. 1(1), P. 3–11. (Rus).
Davisson L. (1973) Universal Noiseless Coding. IEEE. Trans. Inf. Th., Vol. 19 (6), P. 783–795.
Krichevskii R.E. (1968) A Relation Between the Plausibility of Information about a Source and Encoding Redundancy. Problems of Information Transmission. Vol. 4, N 3, P. 48–57. (Rus).
Ryabko B.Ja. (1980,a) Universal Encoding of Compacts. Dokl. Acad. Sci. USSR. Vol. 252(6), P. 1325–1328. (Rus).
Ryabko B.Ja. (1980,b) Information Compression by a Book Stack. Problems of Information Transmission. Vol. 16(4), P. 16–21. (Rus)
Bentley J.L., Sleator D.D., Tarjan R.E., Wei V.K. (1986) A Locally Adaptive Data Compression Scheme. Comm. of ACM, Vol. 29 (4), P. 320–330.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Krichevsky, R. (1994). Universal Codes. In: Universal Compression and Retrieval. Mathematics and Its Applications, vol 274. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-3628-2_5
Download citation
DOI: https://doi.org/10.1007/978-94-017-3628-2_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4357-3
Online ISBN: 978-94-017-3628-2
eBook Packages: Springer Book Archive