Sign In

Login

Password

Forgot Password ? Sign Up

Huffman coding (English Wikipedia)

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

refsWebsite
Global rank English rank
6doi.org
2nd place
2nd place
2semanticscholar.org
11th place
8th place
1compression.ru
low place
low place
1uu.nl
2,467th place
2,049th place
1books.google.com
3rd place
3rd place
1huffmancoding.com
low place
low place
1pearson.com
low place
8,600th place
1arxiv.org
69th place
59th place
1psu.edu
207th place
136th place
1fu-berlin.de
3,329th place
4,598th place
1harvard.edu
18th place
17th place
1jstor.org
26th place
20th place

arxiv.org (Global: 69th place; English: 59th place)

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

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

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: 2nd place; English: 2nd 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. CiteSeerX 10.1.1.589.4726. 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,329th place; English: 4,598th place)

page.mi.fu-berlin.de

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

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

jstor.org (Global: 26th place; English: 20th place)

pearson.com (Global: low place; English: 8,600th place)

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

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

api.semanticscholar.org

uu.nl (Global: 2,467th place; English: 2,049th place)

staff.science.uu.nl