Laplace's law of succession and universal encoding

IEEE Transactions on Information Theory

Volumn 44, Issue 1, 1998, Pages 296-303

  Rrichevskiy, Rafail E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); FUNCTIONS; PROBABILITY; REDUNDANCY; SET THEORY; SIGNAL ENCODING; THEOREM PROVING;

DESCRIPTION LENGTH; JEFFREY'S RULE; LAPLACE'S LAW OF SUCCESSION; UNIVERSAL ENCODING THEORY;

INFORMATION THEORY;

EID: 0031675931     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.651051     Document Type: Article

References (6)

1. E.N. Gilbert, "Codes based on inaccurate source probabilities," IEEE Trans. Inform Theory, vol. IT-17, pp. 304-314, 1971
2. T.M. Cover, "Admissibility properties of Gilbert's encoding for unknown source probabilities," IEEE Trans. Inform. Theory, vol. IT-18, pp. 216-217, 1971
3. R.E. Krichevskii, Universal Compression and Retrieval. Dordrecht, The Netherlands: Kluwer, 1994, 217 pp
4. W. Feller, An Introduction to Probability Theory and its Applications, vol. 1. New York: Wiley
5. R.E. Krichevskii, "Laplace's law of succession and universal encoding," Sobolev Inst. of Math., Novosibirsk, Russia, Nov. 1995, preprint no. 21, 14 pp
6. J. Rissanen, "Universal coding, information, prediction, and estimation," IEEE Trans. Inform. Theory, vol. IT-30, pp. 629-636, 1984.