Huffman coding (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Huffman coding" in English language version.

Last modified: 23:55:23, 13 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

76doi.org

2^nd place

22semanticscholar.org

15^th place

8^th place

21compression.ru

low place

21uu.nl

3,118^th place

2,672^nd place

11books.google.com

3^rd place

11huffmancoding.com

low place

11pearson.com

low place

11arxiv.org

49^th place

31^st place

11fu-berlin.de

3,170^th place

4,291^st place

11adsabs.harvard.edu

14^th place

9^th place

11jstor.org

23^rd place

15^th place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Golin, Mordekai J. (January 1998). "A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs" (PDF). IEEE Transactions on Information Theory. 44 (5) (published 1998-09-01): 1770–1781. Bibcode:1998ITIT...44.1770G. doi:10.1109/18.705558. S2CID 2265146. Retrieved 2024-09-10.

arxiv.org (Global: 49^th place; English: 31^st place)

Gribov, Alexander (2017-04-10). "Optimal Compression of a Polyline with Segments and Arcs". arXiv:1604.07476 [cs.CG].

books.google.com (Global: 3^rd place; English: 3^rd place)

Ze-Nian Li; Mark S. Drew; Jiangchuan Liu (2014-04-09). Fundamentals of Multimedia. Springer Science & Business Media. ISBN 978-3-319-05290-8.

compression.ru (Global: low place; English: low place)

Huffman, D. (1952). "A Method for the Construction of Minimum-Redundancy Codes" (PDF). Proceedings of the IRE. 40 (9): 1098–1101. doi:10.1109/JRPROC.1952.273898.

doi.org (Global: 2^nd place; English: 2^nd place)

Huffman, D. (1952). "A Method for the Construction of Minimum-Redundancy Codes" (PDF). Proceedings of the IRE. 40 (9): 1098–1101. doi:10.1109/JRPROC.1952.273898.
Gallager, R.G.; van Voorhis, D.C. (1975). "Optimal source codes for geometrically distributed integer alphabets". IEEE Transactions on Information Theory. 21 (2): 228–230. doi:10.1109/TIT.1975.1055357.
Abrahams, J. (1997-06-11). "Code and parse trees for lossless source encoding". Written at Arlington, VA, USA. Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171). Division of Mathematics, Computer & Information Sciences, Office of Naval Research (ONR). Salerno: IEEE. pp. 145–171. doi:10.1109/SEQUEN.1997.666911. ISBN 0-8186-8132-2. S2CID 124587565.
Karp, Richard M. (1961-01-31). "Minimum-redundancy coding for the discrete noiseless channel". IRE Transactions on Information Theory. 7 (1). IEEE: 27–38. doi:10.1109/TIT.1961.1057615.
Golin, Mordekai J. (January 1998). "A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs" (PDF). IEEE Transactions on Information Theory. 44 (5) (published 1998-09-01): 1770–1781. Bibcode:1998ITIT...44.1770G. doi:10.1109/18.705558. S2CID 2265146. Retrieved 2024-09-10.
Hu, T. C.; Tucker, A. C. (1971). "Optimal Computer Search Trees and Variable-Length Alphabetical Codes". SIAM Journal on Applied Mathematics. 21 (4): 514. doi:10.1137/0121057. JSTOR 2099603.

fu-berlin.de (Global: 3,170^th place; English: 4,291^st place)

page.mi.fu-berlin.de

Golin, Mordekai J. (January 1998). "A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs" (PDF). IEEE Transactions on Information Theory. 44 (5) (published 1998-09-01): 1770–1781. Bibcode:1998ITIT...44.1770G. doi:10.1109/18.705558. S2CID 2265146. Retrieved 2024-09-10.

huffmancoding.com (Global: low place; English: low place)

Huffman, Ken (1991). "Profile: David A. Huffman: Encoding the "Neatness" of Ones and Zeroes". Scientific American: 54–58.

jstor.org (Global: 23^rd place; English: 15^th place)

Hu, T. C.; Tucker, A. C. (1971). "Optimal Computer Search Trees and Variable-Length Alphabetical Codes". SIAM Journal on Applied Mathematics. 21 (4): 514. doi:10.1137/0121057. JSTOR 2099603.

pearson.com (Global: low place; English: low place)

Kleinberg, Jon; Tardos, Éva (2005-03-16). Algorithm Design (1 ed.). Pearson Education. p. 165. ISBN 978-0-321-29535-4. Retrieved 2025-01-26.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Abrahams, J. (1997-06-11). "Code and parse trees for lossless source encoding". Written at Arlington, VA, USA. Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171). Division of Mathematics, Computer & Information Sciences, Office of Naval Research (ONR). Salerno: IEEE. pp. 145–171. doi:10.1109/SEQUEN.1997.666911. ISBN 0-8186-8132-2. S2CID 124587565.
Golin, Mordekai J. (January 1998). "A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs" (PDF). IEEE Transactions on Information Theory. 44 (5) (published 1998-09-01): 1770–1781. Bibcode:1998ITIT...44.1770G. doi:10.1109/18.705558. S2CID 2265146. Retrieved 2024-09-10.

uu.nl (Global: 3,118^th place; English: 2,672^nd place)

staff.science.uu.nl

Van Leeuwen, Jan (1976). "On the construction of Huffman trees" (PDF). ICALP: 382–410. Retrieved 2014-02-20.

Huffman coding (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

arxiv.org (Global: 49th place; English: 31st place)

books.google.com (Global: 3rd place; English: 3rd place)

compression.ru (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

fu-berlin.de (Global: 3,170th place; English: 4,291st place)

page.mi.fu-berlin.de

huffmancoding.com (Global: low place; English: low place)

jstor.org (Global: 23rd place; English: 15th place)

pearson.com (Global: low place; English: low place)

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

uu.nl (Global: 3,118th place; English: 2,672nd place)

staff.science.uu.nl

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

books.google.com (Global: 3^rd place; English: 3^rd place)

doi.org (Global: 2^nd place; English: 2^nd place)

fu-berlin.de (Global: 3,170^th place; English: 4,291^st place)

jstor.org (Global: 23^rd place; English: 15^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

uu.nl (Global: 3,118^th place; English: 2,672^nd place)