Universal codes for finite sequences of integers drawn from a monotone distribution

IEEE Transactions on Information Theory

Volumn 48, Issue 6, 2002, Pages 1713-1720

  Foster, Dean P ^b   Stine, Robert A ^a,b   Wyner, Abraham J ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Elias codes; Relative redundancy; Strongly minimax; Universal noiseless coding of integers; Wyner's inequality

Indexed keywords

MONOTONE DISTRIBUTIONS; NOISELESS CODES;

ENTROPY; FUNCTIONS; PROBABILITY DISTRIBUTIONS; REDUNDANCY; THEOREM PROVING;

CODES (SYMBOLS);

EID: 0036611938     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.1003851     Document Type: Article

References (10)

1. Universal noiseless coding
2. Universal codeword sets and representations of the integers
3. On universal noiseless source coding for infinite source alphabets
4. There is no universal source code for an infinite source alphabet
5. Compression of low entropy string with Lempel-Ziv algorithms
6. A strong version of the redundancy-capacity theorem of universal coding
7. A universal prior for integers and estimation by minimum description length
8. On coding by probability transformation
9. An upper hound on the entropy series