Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 80, 2003 - Issue 6
Submit an article Journal homepage
45
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Optimal Prefix Codes And Huffman Codes

Dongyang Long Department of Computer Science, Zhongshan University, Guangzhou, 510275, Guangdong, P.R.C.; The State Key Laboratory of Information Security, Chinese Academy of Sciences, Beijing, 100039, P.R.C.
,
Weijia Jia Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, P.R.C.
&
Ming Li School of Computing, National University of Singapore, 119260, Singapore
Pages 727-742 | Published online: 15 Sep 2010

  • Abrahams , J. 1994 . Huffman-type codes for infinite source distributions . J. Franklin Inst. , 331B (3} ) : 265 – 271 .
  • Berstel , J. and Ferrin , D. 1985 . Theory of Codes , Orlando : Academic Press .
  • Bell , T. C. , Cleary , J. G. and Witten , I. H. 1990 . Text Compression , Englewood Cliffs, NJ : Prentice Hall .
  • Cover , T. and Thomas , J. 1991 . Elements of Information Theory , New York : Wiley .
  • Fraenkel , A. S. and Klein , S. T. 1994 . Complexity aspects of guessing prefix codes . Algortihmica , : 409 – 419 .
  • Gallager , R. A. and Van Voorhis , D. C. 1975 . Optimal source coding for geometrically distributed integer alphabets . IEEE Trans. Inform. Theory , IT-21 (3} ) : 228 – 230 .
  • Gillman , D. W. , Mohtashemi , M. and Rivest , R. L. 1996 . On breaking a Huffiman code . IEEE Trans. Inform. Theory , IT-42 (3} ) : 972 – 976 .
  • Huffman , D. A. 1951 . A method for the construction of minimum redundancy codes . Proc. IRE , 40 : 1098 – 1101 .
  • Hankerson , D. , Harris , G. A. and Johnson , P. D. Jr. 1997 . Introduction to Information Theory and Data Compression , CRC Press LLC .
  • Jürgensen , H. and Konstantinidis , S. 1997 . “ Codes. ” . In Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. 1 , 511 – 607 . Berlin, Heidelberg : Springer-Verlag .
  • Jones , D. W. 1988 . Applications of splay trees to data compression . Communication of ACM , 31 : 996 – 1007 .
  • Klein , S. T. , Bookstein , A. and Deerwester , S. 1989 . Storing text-retrieval systems on CD-ROM: Compression and encryption considerations . ACM Trans. Inform. Syst. , 7 : 230 – 245 .
  • Lei , S. M. and Sun , M. T. 1991 . An entropy coding system for digital HDTV applications . IEEE Trans. Circuit Systems Video Technology , 1 : 147 – 155 .
  • Linder , T. , Tarokh , V and Zeger , K. 1997 . Existence of optimal prefix codes for infinite source alphabets . IEEE Trans. Inform. Theory , 43 (6} ) : 2026 – 2028 .
  • Long , D. and Jia , W. Optimal maximal encoding different from Huffman encoding . Proc. of International Conference on Information Technology: Coding and Computing . April 2-4 2001 , Las Vegas. pp. 493 – 497 . IEEE Computer Society .
  • Long , D. and Jia , W. The optimal encoding schemes . Proceedings of 16th Wand Computer Congress . Aug 21-25 2000 , Beijing, China. pp. 25 – 28 . International Academic Publishers . IFIP/SEC2000: Information Security
  • Montgomery , B. and Abrahams , J. 1987 . On the redundancy of optimal binary prefix condition codes for finite and infinite sources . IEEE Trans. Inform. Theory , IT-33 (1} ) : 156 – 160 .
  • Pennebaker , W. B. and Mitchell , J. L. 1993 . JPEG: Still Image Data Compression Standard New York
  • Roman , S. 1996 . Introduction to Coding and Information Theory , New York : Springer-Verlag .
  • Rubin , F. 1979 . Cryptographic aspects of data compression codes . Cryptologia , 3 : 202 – 205 .
  • Salomon , D. 1988 . Data Compression: The Complete Reference , Springer .
  • Vitter , J. S. 1987 . Design and analysis of dynamic Huffman codes . Journal of the Association for Computing Machinery , 34 (4} ) : 825 – 845 .
  • Shyr , H. J. 1991 . Free Monoids and Languages , Taichung, , Taiwan R.O.C. : Hon Min Book Company .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.