On the Redundancy of Optimal Binary Prefix-Condition Codes for Finite and Infinite Sources

IEEE Transactions on Information Theory

Volumn 33, Issue 1, 1987, Pages 156-160

  Montgomery, Bruce L ^a   Abrahams, Julia ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; PROBABILITY;

FINITE/INFINITE SOURCES; OPTIMAL BINARY PREFIX-CONDITION (DBPC) CODES; REDUNDANCY BOUNDS;

CODES, SYMBOLIC;

EID: 0023250198     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1987.1057266     Document Type: Article

References (16)

1. S. Even and A. Lempel, “Generation and enumeration of all solutions of the characteristic sum condition,” Inform. Contr., vol. 21, pp. 476-482, 1972.
2. J. B. Connel, “A Huffman-Shannon-Fano code,” Proc. IEEE, vol. 61, pp. 1046-1047, July 1973.
3. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. XXVII, pp. 379-423, July 1948; pp. 625-656, Oct. 1948.
4. R. M. Fano, Transmission of Information. Cambridge, MA: MIT Press and New York: Wiley, 1961.
5. R. G. Gallager, “Variations on a theme by Huffman,” IEEE Trans. Inform. Theory, vol. IT-24, Nov. 1978.
6. G. Longo and G. Galasso, “An application of informational divergence to Huffman codes,” IEEE Trans. Inform. Theory, vol. IT-28, Jan. 1982.
7. T. J. Ferguson and J. H. Rabinowitz, “Self-synchronizing Huffman codes,” IEEE Trans. Inform. Theory, vol. IT-30, July 1984.
8. A. T. Berztiss, Data Structure“Theory and Practice. New York: Academic, 1975.
9. N. Abramson, Information Theory and Coding. New York: McGraw-Hill, 1963.
10. T. J. Booth, Sequential Machines and Automata Theory. New York: Wiley, 1967.
11. A. Ginzburg. Algebraic Theory of Automata. New York: Academic. 1968.
12. K. S. Fu, Syntactic Method in Pattern Recognition. New York: Academic, 1968.
13. R. G. Gallager, “Variations on a theme by Huffman,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 668-674, Nov. 1978.
14. O. Johnsen, “On the redundancy of binary Huffman codes,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 220-222, Mar. 1980.
15. R. G. Gallager, “Optimal source codes for geometrically distributed integer alphabets,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 228-230, Mar. 1975.
16. P. Humblet, “Optimal source coding for a class of integer alphabets.” IEEE Trans. Inform. Theory, vol. IT-24,. 110-112, Jan. 1978.