论文信息 - On Universal Codeword Sets

On Universal Codeword Sets

The set of all binary strings terminated by a specific pattern is countably infinite and regular and satisfies the prefix property. Some properties of such codeword sets in the context of source coding are studied. It is shown that some of them are universal and some of them are not, but none is asymptotically optimal.

K. B. Lakshmanan

[1] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[2] Aaron D. Wyner,et al. An Upper Bound on the Entropy Series , 1972, Inf. Control..

[3] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[4] Solomon W. Golomb,et al. Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.

[5] Pierre A. Humblet,et al. Optimal source coding for a class of integer alphabets (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[6] S. Golomb. A class of probability distributions on the integers , 1970 .

[7] David C. van Voorhis,et al. Optimal source codes for geometrically distributed integer alphabets (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[8] S. Golomb. Run-length encodings. , 1966 .