René's URL Explorer Experiment


Title: Huffman coding - Wikipedia

Open Graph Title: Huffman coding - Wikipedia

Generator: MediaWiki 1.48.0-wmf.1

direct link

Domain: en.wikipedia.org

Hey, it has json ld scripts: 
{"@context":"https:\/\/schema.org","@type":"Article","name":"Huffman coding","url":"https:\/\/en.wikipedia.org\/wiki\/Huffman_coding","sameAs":"http:\/\/www.wikidata.org\/entity\/Q2647","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q2647","author":{"@type":"Organization","name":"Contributors to Wikimedia projects"},"publisher":{"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":{"@type":"ImageObject","url":"https:\/\/www.wikimedia.org\/static\/images\/wmf-hor-googpub.png"}},"datePublished":"2001-10-30T15:10:22Z","dateModified":"2026-10-07T11:57:38Z","image":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/8\/82\/Huffman_tree_2.svg?utm_source=en.wikipedia.org&utm_campaign=index&utm_content=original","headline":"entropy encoding algorithm used for lossless data compression"}
referrerorigin-when-cross-origin
format-detectiontelephone=no
og:imagehttps://thumb.wikimedia.org/wikipedia/commons/thumb/8/82/Huffman_tree_2.svg/1280px-Huffman_tree_2.svg.png?utm_source=en.wikipedia.org&utm_campaign=index&utm_content=thumbnail
og:image:width1200
og:image:height772
og:typewebsite

Links:

Jump to contenthttps://en.wikipedia.org/wiki/Huffman_coding#bodyContent
Main pagehttps://en.wikipedia.org/wiki/Main_Page
Contentshttps://en.wikipedia.org/wiki/Wikipedia:Contents
Current eventshttps://en.wikipedia.org/wiki/Portal:Current_events
Random articlehttps://en.wikipedia.org/wiki/Special:Random
About Wikipediahttps://en.wikipedia.org/wiki/Wikipedia:About
Contact ushttps://en.wikipedia.org/wiki/Wikipedia:Contact_us
Helphttps://en.wikipedia.org/wiki/Help:Contents
Learn to edithttps://en.wikipedia.org/wiki/Help:Introduction
Community portalhttps://en.wikipedia.org/wiki/Wikipedia:Community_portal
Recent changeshttps://en.wikipedia.org/wiki/Special:RecentChanges
Upload filehttps://en.wikipedia.org/wiki/Wikipedia:File_upload_wizard
Special pageshttps://en.wikipedia.org/wiki/Special:SpecialPages
https://en.wikipedia.org/wiki/Main_Page
Search https://en.wikipedia.org/wiki/Special:Search
Donatehttps://donate.wikimedia.org/?wmf_source=donate&wmf_medium=sidebar&wmf_campaign=en.wikipedia.org&uselang=en
Create accounthttps://en.wikipedia.org/w/index.php?title=Special:CreateAccount&returnto=Huffman+coding
Log inhttps://en.wikipedia.org/w/index.php?title=Special:UserLogin&returnto=Huffman+coding
Donatehttps://donate.wikimedia.org/?wmf_source=donate&wmf_medium=sidebar&wmf_campaign=en.wikipedia.org&uselang=en
Create accounthttps://en.wikipedia.org/w/index.php?title=Special:CreateAccount&returnto=Huffman+coding
Log inhttps://en.wikipedia.org/w/index.php?title=Special:UserLogin&returnto=Huffman+coding
(Top) https://en.wikipedia.org/wiki/Huffman_coding
1 History https://en.wikipedia.org/wiki/Huffman_coding#History
2 Terminology https://en.wikipedia.org/wiki/Huffman_coding#Terminology
3 Problem definition https://en.wikipedia.org/wiki/Huffman_coding#Problem_definition
3.1 Informal description https://en.wikipedia.org/wiki/Huffman_coding#Informal_description
3.2 Formalized description https://en.wikipedia.org/wiki/Huffman_coding#Formalized_description
3.3 Example https://en.wikipedia.org/wiki/Huffman_coding#Example
4 Basic technique https://en.wikipedia.org/wiki/Huffman_coding#Basic_technique
4.1 Compression https://en.wikipedia.org/wiki/Huffman_coding#Compression
4.2 Decompression https://en.wikipedia.org/wiki/Huffman_coding#Decompression
5 Main properties https://en.wikipedia.org/wiki/Huffman_coding#Main_properties
5.1 Optimality https://en.wikipedia.org/wiki/Huffman_coding#Optimality
6 Variations https://en.wikipedia.org/wiki/Huffman_coding#Variations
6.1 n-ary Huffman coding https://en.wikipedia.org/wiki/Huffman_coding#n-ary_Huffman_coding
6.2 Adaptive Huffman coding https://en.wikipedia.org/wiki/Huffman_coding#Adaptive_Huffman_coding
6.3 Huffman template algorithm https://en.wikipedia.org/wiki/Huffman_coding#Huffman_template_algorithm
6.4 Length-limited Huffman coding/minimum variance Huffman coding https://en.wikipedia.org/wiki/Huffman_coding#Length-limited_Huffman_coding/minimum_variance_Huffman_coding
6.5 Huffman coding with unequal letter costs https://en.wikipedia.org/wiki/Huffman_coding#Huffman_coding_with_unequal_letter_costs
6.6 Optimal alphabetic binary trees (Hu–Tucker coding) https://en.wikipedia.org/wiki/Huffman_coding#Optimal_alphabetic_binary_trees_(Hu–Tucker_coding)
6.7 The canonical Huffman code https://en.wikipedia.org/wiki/Huffman_coding#The_canonical_Huffman_code
7 Applications https://en.wikipedia.org/wiki/Huffman_coding#Applications
8 References https://en.wikipedia.org/wiki/Huffman_coding#References
9 Bibliography https://en.wikipedia.org/wiki/Huffman_coding#Bibliography
10 External links https://en.wikipedia.org/wiki/Huffman_coding#External_links
العربيةhttps://ar.wikipedia.org/wiki/%D8%AA%D8%B1%D9%85%D9%8A%D8%B2_%D9%87%D9%88%D9%81%D9%85%D8%A7%D9%86
Azərbaycancahttps://az.wikipedia.org/wiki/Haffman_kodla%C5%9Fd%C4%B1rmas%C4%B1
Catalàhttps://ca.wikipedia.org/wiki/Codificaci%C3%B3_de_Huffman
Češtinahttps://cs.wikipedia.org/wiki/Huffmanovo_k%C3%B3dov%C3%A1n%C3%AD
Danskhttps://da.wikipedia.org/wiki/Huffman-kodning
Deutschhttps://de.wikipedia.org/wiki/Huffman-Kodierung
Ελληνικάhttps://el.wikipedia.org/wiki/%CE%9A%CF%89%CE%B4%CE%B9%CE%BA%CE%BF%CF%80%CE%BF%CE%AF%CE%B7%CF%83%CE%B7_%CE%A7%CE%BF%CF%8D%CF%86%CE%BC%CE%B1%CE%BD
Esperantohttps://eo.wikipedia.org/wiki/Kodado_de_Huffman
Españolhttps://es.wikipedia.org/wiki/Codificaci%C3%B3n_Huffman
Eestihttps://et.wikipedia.org/wiki/Huffmani_kodeerimine
Euskarahttps://eu.wikipedia.org/wiki/Huffman_kodifikazio
فارسیhttps://fa.wikipedia.org/wiki/%DA%A9%D8%AF%DA%AF%D8%B0%D8%A7%D8%B1%DB%8C_%D9%87%D8%A7%D9%81%D9%85%D9%86
Suomihttps://fi.wikipedia.org/wiki/Huffmanin_koodaus
Françaishttps://fr.wikipedia.org/wiki/Codage_de_Huffman
עבריתhttps://he.wikipedia.org/wiki/%D7%A7%D7%95%D7%93_%D7%94%D7%90%D7%A4%D7%9E%D7%9F
Magyarhttps://hu.wikipedia.org/wiki/Huffman-k%C3%B3dol%C3%A1s
Bahasa Indonesiahttps://id.wikipedia.org/wiki/Pengodean_Huffman
Italianohttps://it.wikipedia.org/wiki/Codifica_di_Huffman
日本語https://ja.wikipedia.org/wiki/%E3%83%8F%E3%83%95%E3%83%9E%E3%83%B3%E7%AC%A6%E5%8F%B7
ქართულიhttps://ka.wikipedia.org/wiki/%E1%83%B0%E1%83%90%E1%83%A4%E1%83%9B%E1%83%94%E1%83%9C%E1%83%98%E1%83%A1_%E1%83%99%E1%83%9D%E1%83%93%E1%83%98
한국어https://ko.wikipedia.org/wiki/%ED%97%88%ED%94%84%EB%A8%BC_%EB%B6%80%ED%98%B8%ED%99%94
Lombardhttps://lmo.wikipedia.org/wiki/Codifica_de_Huffman
മലയാളംhttps://ml.wikipedia.org/wiki/%E0%B4%B9%E0%B4%AB%E0%B5%8D%E2%80%8C%E0%B4%AE%E0%B4%BE%E0%B5%BB_%E0%B4%95%E0%B5%8B%E0%B4%A1%E0%B4%BF%E0%B4%99%E0%B5%8D
Nederlandshttps://nl.wikipedia.org/wiki/Huffmancodering
Norsk bokmålhttps://no.wikipedia.org/wiki/Huffman-koding
Polskihttps://pl.wikipedia.org/wiki/Kodowanie_Huffmana
Portuguêshttps://pt.wikipedia.org/wiki/Codifica%C3%A7%C3%A3o_de_Huffman
Русскийhttps://ru.wikipedia.org/wiki/%D0%9A%D0%BE%D0%B4_%D0%A5%D0%B0%D1%84%D1%84%D0%BC%D0%B0%D0%BD%D0%B0
Simple Englishhttps://simple.wikipedia.org/wiki/Huffman_coding
Slovenčinahttps://sk.wikipedia.org/wiki/Huffmanovo_k%C3%B3dovanie
Српски / srpskihttps://sr.wikipedia.org/wiki/%D0%A5%D0%B0%D1%84%D0%BC%D0%B0%D0%BD%D0%BE%D0%B2%D0%B8_%D0%BA%D0%BE%D0%B4%D0%BE%D0%B2%D0%B8
Svenskahttps://sv.wikipedia.org/wiki/Huffmankodning
ไทยhttps://th.wikipedia.org/wiki/%E0%B8%81%E0%B8%B2%E0%B8%A3%E0%B9%80%E0%B8%82%E0%B9%89%E0%B8%B2%E0%B8%A3%E0%B8%AB%E0%B8%B1%E0%B8%AA%E0%B8%AE%E0%B8%B1%E0%B8%9F%E0%B8%9F%E0%B9%8C%E0%B9%81%E0%B8%A1%E0%B8%99
Türkçehttps://tr.wikipedia.org/wiki/Huffman_kodu
Українськаhttps://uk.wikipedia.org/wiki/%D0%9A%D0%BE%D0%B4_%D0%93%D0%B0%D1%84%D1%84%D0%BC%D0%B0%D0%BD%D0%B0
Tiếng Việthttps://vi.wikipedia.org/wiki/M%C3%A3_h%C3%B3a_Huffman
中文https://zh.wikipedia.org/wiki/%E9%9C%8D%E5%A4%AB%E6%9B%BC%E7%BC%96%E7%A0%81
Edit linkshttps://www.wikidata.org/wiki/Special:EntityPage/Q2647#sitelinks-wikipedia
Articlehttps://en.wikipedia.org/wiki/Huffman_coding
Talkhttps://en.wikipedia.org/wiki/Talk:Huffman_coding
Readhttps://en.wikipedia.org/wiki/Huffman_coding
Edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit
View historyhttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=history
Readhttps://en.wikipedia.org/wiki/Huffman_coding
Edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit
View historyhttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=history
What links herehttps://en.wikipedia.org/wiki/Special:WhatLinksHere/Huffman_coding
Related changeshttps://en.wikipedia.org/wiki/Special:RecentChangesLinked/Huffman_coding
Upload filehttps://en.wikipedia.org/wiki/Wikipedia:File_Upload_Wizard
Permanent linkhttps://en.wikipedia.org/w/index.php?title=Huffman_coding&oldid=1379018579
Page informationhttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=info
Cite this pagehttps://en.wikipedia.org/w/index.php?title=Special:CiteThisPage&page=Huffman_coding&id=1379018579&wpFormIdentifier=titleform
Get shortened URLhttps://en.wikipedia.org/w/index.php?title=Special:UrlShortener&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FHuffman_coding
Switch to legacy parserhttps://en.wikipedia.org/w/index.php?title=Huffman_coding&useparsoid=0
Download as PDFhttps://en.wikipedia.org/w/index.php?title=Special:DownloadAsPdf&page=Huffman_coding&action=show-download-screen
Printable versionjavascript:print();
Wikimedia Commonshttps://commons.wikimedia.org/wiki/Category:Huffman_coding
Wikidata itemhttps://www.wikidata.org/wiki/Special:EntityPage/Q2647
Hamming codehttps://en.wikipedia.org/wiki/Hamming_code
https://en.wikipedia.org/wiki/File:Huffman_tree_2.svg
computer sciencehttps://en.wikipedia.org/wiki/Computer_science
information theoryhttps://en.wikipedia.org/wiki/Information_theory
prefix codehttps://en.wikipedia.org/wiki/Prefix_code
lossless data compressionhttps://en.wikipedia.org/wiki/Lossless_compression
David A. Huffmanhttps://en.wikipedia.org/wiki/David_A._Huffman
Sc.D.https://en.wikipedia.org/wiki/Doctor_of_Science
MIThttps://en.wikipedia.org/wiki/Massachusetts_Institute_of_Technology
[1]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-:0-1
variable-length codehttps://en.wikipedia.org/wiki/Variable-length_code
entropy encodinghttps://en.wikipedia.org/wiki/Entropy_encoding
linearhttps://en.wikipedia.org/wiki/Linear_time
[2]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-vlw-2
is not always optimalhttps://en.wikipedia.org/wiki/Huffman_coding#Optimality
arithmetic codinghttps://en.wikipedia.org/wiki/Arithmetic_coding
[3]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-LiDrew2014-3
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=1
David A. Huffmanhttps://en.wikipedia.org/wiki/David_A._Huffman
MIThttps://en.wikipedia.org/wiki/MIT
information theoryhttps://en.wikipedia.org/wiki/Information_theory
examhttps://en.wikipedia.org/wiki/Exam
Robert M. Fanohttps://en.wikipedia.org/wiki/Robert_M._Fano
term paperhttps://en.wikipedia.org/wiki/Term_paper
binary treehttps://en.wikipedia.org/wiki/Binary_tree
[4]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-4
Claude Shannonhttps://en.wikipedia.org/wiki/Claude_Shannon
Shannon–Fano codinghttps://en.wikipedia.org/wiki/Shannon–Fano_coding
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=2
prefix codehttps://en.wikipedia.org/wiki/Prefix_code
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=3
https://en.wikipedia.org/wiki/File:Question_book-new.svg
more citationshttps://en.wikipedia.org/wiki/Wikipedia:Verifiability
improve this articlehttps://en.wikipedia.org/wiki/Special:EditPage/Huffman_coding
adding citations to reliable sourceshttps://en.wikipedia.org/wiki/Help:Referencing_for_beginners
removedhttps://en.wikipedia.org/wiki/Wikipedia:Verifiability#Burden_of_evidence
"Huffman coding"https://www.google.com/search?as_eq=wikipedia&q=%22Huffman+coding%22
newshttps://www.google.com/search?tbm=nws&q=%22Huffman+coding%22+-wikipedia&tbs=ar:1
newspapershttps://www.google.com/search?&q=%22Huffman+coding%22&tbs=bkt:s&tbm=bks
bookshttps://www.google.com/search?tbs=bks:1&q=%22Huffman+coding%22+-wikipedia
scholarhttps://scholar.google.com/scholar?q=%22Huffman+coding%22
JSTORhttps://www.jstor.org/action/doBasicSearch?Query=%22Huffman+coding%22&acc=on&wc=on
Learn how and when to remove this messagehttps://en.wikipedia.org/wiki/Help:Maintenance_template_removal
https://en.wikipedia.org/wiki/File:HuffmanCodeAlg.png
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=4
[5]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-kleinberg&Tardos-5
prefix-free binary codehttps://en.wikipedia.org/wiki/Prefix_code
expectedhttps://en.wikipedia.org/wiki/Expected_value
weighted path length from the roothttps://en.wikipedia.org/wiki/Glossary_of_graph_theory#W
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=5
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=6
Shannon entropyhttps://en.wikipedia.org/wiki/Shannon_entropy
uniquely decodeablehttps://en.wikipedia.org/wiki/Variable-length_code#Uniquely_decodable_codes
Shannon (1948)https://en.wikipedia.org/wiki/A_Mathematical_Theory_of_Communication
entropyhttps://en.wikipedia.org/wiki/Information_entropy
Shannon's source coding theoremhttps://en.wikipedia.org/wiki/Shannon's_source_coding_theorem
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=7
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=8
https://en.wikipedia.org/wiki/File:Huffman_coding_visualisation.svg
https://en.wikipedia.org/wiki/File:Huffman_coding_example.svg
entropyhttps://en.wikipedia.org/wiki/Information_entropy
binary treehttps://en.wikipedia.org/wiki/Binary_tree
arrayhttps://en.wikipedia.org/wiki/Array_data_type
leaf nodehttps://en.wikipedia.org/wiki/Leaf_node
internal nodehttps://en.wikipedia.org/wiki/Internal_node
priority queuehttps://en.wikipedia.org/wiki/Priority_queue
linear-timehttps://en.wikipedia.org/wiki/Linear-time
queueshttps://en.wikipedia.org/wiki/Queue_(data_structure)
[2]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-vlw-2
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=9
canonical encodinghttps://en.wikipedia.org/wiki/Canonical_Huffman_code
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=10
frequency tablehttps://en.wikipedia.org/wiki/Frequency_table
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=11
Arithmetic coding § Huffman codinghttps://en.wikipedia.org/wiki/Arithmetic_coding#Huffman_coding
probability mass functionshttps://en.wikipedia.org/wiki/Probability_mass_function
independent and identically distributedhttps://en.wikipedia.org/wiki/Independent_and_identically_distributed
arithmetic codinghttps://en.wikipedia.org/wiki/Arithmetic_coding
patenthttps://en.wikipedia.org/wiki/Patent
power of twohttps://en.wikipedia.org/wiki/Power_of_two
block encodinghttps://en.wikipedia.org/wiki/Block_code
ASCIIhttps://en.wikipedia.org/wiki/ASCII
dyadichttps://en.wikipedia.org/wiki/Dyadic_distribution
[6]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-6
run-length encodinghttps://en.wikipedia.org/wiki/Run-length_encoding
Bernoulli processeshttps://en.wikipedia.org/wiki/Bernoulli_process
Golomb codinghttps://en.wikipedia.org/wiki/Golomb_coding
[7]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-7
modified Huffman codinghttps://en.wikipedia.org/wiki/Modified_Huffman_coding
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=12
[8]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-8
polynomial timehttps://en.wikipedia.org/wiki/Polynomial_time
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=13
[1]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-:0-1
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=14
adaptive Huffman codinghttps://en.wikipedia.org/wiki/Adaptive_Huffman_coding
adaptive arithmetic codinghttps://en.wikipedia.org/wiki/Arithmetic_coding#Adaptive_arithmetic_coding
citation neededhttps://en.wikipedia.org/wiki/Wikipedia:Citation_needed
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=15
totally orderedhttps://en.wikipedia.org/wiki/Total_order
commutative monoidhttps://en.wikipedia.org/wiki/Monoid#Commutative_monoid
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=16
package-merge algorithmhttps://en.wikipedia.org/wiki/Package-merge_algorithm
greedyhttps://en.wikipedia.org/wiki/Greedy_algorithm
O ( n ) {\displaystyle O(n)} or O ( n log ⁡ n ) {\displaystyle O(n\log n)} https://en.wikipedia.org/wiki/Big_O_notation#Orders_of_common_functions
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=17
Morse codehttps://en.wikipedia.org/wiki/Morse_code
Richard M. Karphttps://en.wikipedia.org/wiki/Richard_M._Karp
[9]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-9
[10]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-10
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=18
T. C. Huhttps://en.wikipedia.org/wiki/T._C._Hu
Alan Tuckerhttps://en.wikipedia.org/wiki/Alan_Tucker
O ( n log ⁡ n ) {\displaystyle O(n\log n)} -timehttps://en.wikipedia.org/wiki/Time_complexity#Quasilinear_time
[11]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-11
Garsia–Wachs algorithmhttps://en.wikipedia.org/wiki/Garsia–Wachs_algorithm
Adriano Garsiahttps://en.wikipedia.org/wiki/Adriano_Garsia
Michelle L. Wachshttps://en.wikipedia.org/wiki/Michelle_L._Wachs
binary search treeshttps://en.wikipedia.org/wiki/Binary_search_tree
[12]https://en.wikipedia.org/wiki/Huffman_coding#cite_note-12
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=19
Canonical Huffman codehttps://en.wikipedia.org/wiki/Canonical_Huffman_code
Shannon–Fano codinghttps://en.wikipedia.org/wiki/Shannon–Fano_coding
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=20
Arithmetic codinghttps://en.wikipedia.org/wiki/Arithmetic_coding
citation neededhttps://en.wikipedia.org/wiki/Wikipedia:Citation_needed
lack of patent coveragehttps://en.wikipedia.org/wiki/Arithmetic_coding#History_and_patents
Deflatehttps://en.wikipedia.org/wiki/Deflate
PKZIPhttps://en.wikipedia.org/wiki/PKZIP
codecshttps://en.wikipedia.org/wiki/Codec
JPEGhttps://en.wikipedia.org/wiki/JPEG
MP3https://en.wikipedia.org/wiki/MP3
quantizationhttps://en.wikipedia.org/wiki/Quantization_(signal_processing)
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=21
https://en.wikipedia.org/wiki/File:Commons-logo.svg
Huffman codinghttps://commons.wikimedia.org/wiki/Category:Huffman%20coding
1https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-:0_1-0
2https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-:0_1-1
Huffman, D.https://en.wikipedia.org/wiki/David_A._Huffman
"A Method for the Construction of Minimum-Redundancy Codes"http://compression.ru/download/articles/huff/huffman_1952_minimum-redundancy-codes.pdf
Proceedings of the IREhttps://en.wikipedia.org/wiki/Proceedings_of_the_IRE
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1109/JRPROC.1952.273898https://doi.org/10.1109%2FJRPROC.1952.273898
1https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-vlw_2-0
2https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-vlw_2-1
Van Leeuwen, Janhttps://en.wikipedia.org/wiki/Jan_van_Leeuwen_(computer_scientist)
"On the construction of Huffman trees"http://www.staff.science.uu.nl/~leeuw112/huffman.pdf
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-LiDrew2014_3-0
Fundamentals of Multimediahttps://books.google.com/books?id=R6vBBAAAQBAJ
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
978-3-319-05290-8https://en.wikipedia.org/wiki/Special:BookSources/978-3-319-05290-8
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-4
"Profile: David A. Huffman: Encoding the "Neatness" of Ones and Zeroes"http://www.huffmancoding.com/my-uncle/scientific-american
Scientific Americanhttps://en.wikipedia.org/wiki/Scientific_American
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-kleinberg&Tardos_5-0
Algorithm Designhttps://www.pearson.com/en-us/subject-catalog/p/algorithm-design/P200000003259/9780137546350
Pearson Educationhttps://en.wikipedia.org/wiki/Pearson_Education
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
978-0-321-29535-4https://en.wikipedia.org/wiki/Special:BookSources/978-0-321-29535-4
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-6
arXivhttps://en.wikipedia.org/wiki/ArXiv_(identifier)
1604.07476https://arxiv.org/abs/1604.07476
cs.CGhttps://arxiv.org/archive/cs.CG
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-7
IEEE Transactions on Information Theoryhttps://en.wikipedia.org/wiki/IEEE_Transactions_on_Information_Theory
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1109/TIT.1975.1055357https://doi.org/10.1109%2FTIT.1975.1055357
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-8
Office of Naval Researchhttps://en.wikipedia.org/wiki/Office_of_Naval_Research
IEEEhttps://en.wikipedia.org/wiki/IEEE
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1109/SEQUEN.1997.666911https://doi.org/10.1109%2FSEQUEN.1997.666911
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
0-8186-8132-2https://en.wikipedia.org/wiki/Special:BookSources/0-8186-8132-2
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
124587565https://api.semanticscholar.org/CorpusID:124587565
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-9
Karp, Richard M.https://en.wikipedia.org/wiki/Richard_M._Karp
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1109/TIT.1961.1057615https://doi.org/10.1109%2FTIT.1961.1057615
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-10
"A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs"https://page.mi.fu-berlin.de/rote/Papers/pdf/A+dynamic+programming+algorithm+for+constructing+optimal+prefix-free+codes+for+unequal+letter+costs.pdf
Bibcodehttps://en.wikipedia.org/wiki/Bibcode_(identifier)
1998ITIT...44.1770Ghttps://ui.adsabs.harvard.edu/abs/1998ITIT...44.1770G
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1109/18.705558https://doi.org/10.1109%2F18.705558
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
2265146https://api.semanticscholar.org/CorpusID:2265146
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-11
Hu, T. C.https://en.wikipedia.org/wiki/T._C._Hu
Tucker, A. C.https://en.wikipedia.org/wiki/Alan_Tucker
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1137/0121057https://doi.org/10.1137%2F0121057
JSTORhttps://en.wikipedia.org/wiki/JSTOR_(identifier)
2099603https://www.jstor.org/stable/2099603
↑https://en.wikipedia.org/wiki/Huffman_coding#cite_ref-12
Knuth, Donald E.https://en.wikipedia.org/wiki/Donald_Knuth
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=22
Thomas H. Cormenhttps://en.wikipedia.org/wiki/Thomas_H._Cormen
Charles E. Leisersonhttps://en.wikipedia.org/wiki/Charles_E._Leiserson
Ronald L. Rivesthttps://en.wikipedia.org/wiki/Ronald_L._Rivest
Clifford Steinhttps://en.wikipedia.org/wiki/Clifford_Stein
Introduction to Algorithmshttps://en.wikipedia.org/wiki/Introduction_to_Algorithms
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
0-262-03293-7https://en.wikipedia.org/wiki/Special:BookSources/0-262-03293-7
edithttps://en.wikipedia.org/w/index.php?title=Huffman_coding&action=edit§ion=23
Huffman coding in various languages on Rosetta Codehttp://rosettacode.org/wiki/Huffman_coding
Huffman codes (python implementation)https://gist.github.com/jasonrdsouza/1c9c895f43497d15eb2e
Canonical Huffman codes (C implementation)https://github.com/gdavidbutler/canonicalHuffman
A visualization of Huffman codinghttps://www.tinyray.com/huffman
vhttps://en.wikipedia.org/wiki/Template:Compression_methods
thttps://en.wikipedia.org/wiki/Template_talk:Compression_methods
ehttps://en.wikipedia.org/wiki/Special:EditPage/Template:Compression_methods
Data compressionhttps://en.wikipedia.org/wiki/Data_compression
Losslesshttps://en.wikipedia.org/wiki/Lossless_compression
Entropyhttps://en.wikipedia.org/wiki/Entropy_coding
Adaptive codinghttps://en.wikipedia.org/wiki/Adaptive_coding
Arithmetichttps://en.wikipedia.org/wiki/Arithmetic_coding
Asymmetric numeral systemshttps://en.wikipedia.org/wiki/Asymmetric_numeral_systems
Golombhttps://en.wikipedia.org/wiki/Golomb_coding
Huffmanhttps://en.wikipedia.org/wiki/Huffman_coding
Adaptivehttps://en.wikipedia.org/wiki/Adaptive_Huffman_coding
Canonicalhttps://en.wikipedia.org/wiki/Canonical_Huffman_code
Modifiedhttps://en.wikipedia.org/wiki/Modified_Huffman_coding
Rangehttps://en.wikipedia.org/wiki/Range_coding
Shannonhttps://en.wikipedia.org/wiki/Shannon_coding
Shannon–Fanohttps://en.wikipedia.org/wiki/Shannon–Fano_coding
Shannon–Fano–Eliashttps://en.wikipedia.org/wiki/Shannon–Fano–Elias_coding
Tunstallhttps://en.wikipedia.org/wiki/Tunstall_coding
Unaryhttps://en.wikipedia.org/wiki/Unary_coding
Universalhttps://en.wikipedia.org/wiki/Universal_code_(data_compression)
Exp-Golombhttps://en.wikipedia.org/wiki/Exponential-Golomb_coding
Fibonaccihttps://en.wikipedia.org/wiki/Fibonacci_coding
Gammahttps://en.wikipedia.org/wiki/Elias_gamma_coding
Levenshteinhttps://en.wikipedia.org/wiki/Levenshtein_coding
Dictionaryhttps://en.wikipedia.org/wiki/Dictionary_coder
Byte-pair encodinghttps://en.wikipedia.org/wiki/Byte-pair_encoding
Lempel–Zivhttps://en.wikipedia.org/wiki/LZ77_and_LZ78
842https://en.wikipedia.org/wiki/842_(compression_algorithm)
LZ4https://en.wikipedia.org/wiki/LZ4_(compression_algorithm)
LZJBhttps://en.wikipedia.org/wiki/LZJB
LZOhttps://en.wikipedia.org/wiki/Lempel–Ziv–Oberhumer
LZRWhttps://en.wikipedia.org/wiki/LZRW
LZSShttps://en.wikipedia.org/wiki/Lempel–Ziv–Storer–Szymanski
LZWhttps://en.wikipedia.org/wiki/Lempel–Ziv–Welch
LZWLhttps://en.wikipedia.org/wiki/LZWL
Snappyhttps://en.wikipedia.org/wiki/Snappy_(compression)
BWThttps://en.wikipedia.org/wiki/Burrows–Wheeler_transform
CTWhttps://en.wikipedia.org/wiki/Context_tree_weighting
CMhttps://en.wikipedia.org/wiki/Context_mixing
Deltahttps://en.wikipedia.org/wiki/Delta_encoding
Incrementalhttps://en.wikipedia.org/wiki/Incremental_encoding
DMChttps://en.wikipedia.org/wiki/Dynamic_Markov_compression
DPCMhttps://en.wikipedia.org/wiki/Differential_pulse-code_modulation
Grammarhttps://en.wikipedia.org/wiki/Grammar-based_code
Re-Pairhttps://en.wikipedia.org/wiki/Re-Pair
Sequiturhttps://en.wikipedia.org/wiki/Sequitur_algorithm
LDCThttps://en.wikipedia.org/wiki/Discrete_cosine_transform
MTFhttps://en.wikipedia.org/wiki/Move-to-front_transform
PAQhttps://en.wikipedia.org/wiki/PAQ
PPMhttps://en.wikipedia.org/wiki/Prediction_by_partial_matching
RLEhttps://en.wikipedia.org/wiki/Run-length_encoding
Deflatehttps://en.wikipedia.org/wiki/Deflate
LZXhttps://en.wikipedia.org/wiki/LZX
LZShttps://en.wikipedia.org/wiki/Lempel–Ziv–Stac
LZFSEhttps://en.wikipedia.org/wiki/LZFSE
Zstandardhttps://en.wikipedia.org/wiki/Zstd
Brotlihttps://en.wikipedia.org/wiki/Brotli
LHA/LZHhttps://en.wikipedia.org/wiki/LHA_(file_format)
LZMAhttps://en.wikipedia.org/wiki/LZMA
bzip2https://en.wikipedia.org/wiki/Bzip2
Lossyhttps://en.wikipedia.org/wiki/Lossy_compression
Transformhttps://en.wikipedia.org/wiki/Transform_coding
Discrete cosine transformhttps://en.wikipedia.org/wiki/Discrete_cosine_transform
DCThttps://en.wikipedia.org/wiki/Discrete_cosine_transform
MDCThttps://en.wikipedia.org/wiki/Modified_discrete_cosine_transform
DSThttps://en.wikipedia.org/wiki/Discrete_sine_transform
FFThttps://en.wikipedia.org/wiki/Fast_Fourier_transform
Wavelethttps://en.wikipedia.org/wiki/Wavelet_transform
Daubechieshttps://en.wikipedia.org/wiki/Daubechies_wavelet
DWThttps://en.wikipedia.org/wiki/Discrete_wavelet_transform
SPIHThttps://en.wikipedia.org/wiki/Set_partitioning_in_hierarchical_trees
DPCMhttps://en.wikipedia.org/wiki/Differential_pulse-code_modulation
ADPCMhttps://en.wikipedia.org/wiki/Adaptive_differential_pulse-code_modulation
LPChttps://en.wikipedia.org/wiki/Linear_predictive_coding
ACELPhttps://en.wikipedia.org/wiki/Algebraic_code-excited_linear_prediction
CELPhttps://en.wikipedia.org/wiki/Code-excited_linear_prediction
LARhttps://en.wikipedia.org/wiki/Log_area_ratio
LSPhttps://en.wikipedia.org/wiki/Line_spectral_pairs
WLPChttps://en.wikipedia.org/wiki/Warped_linear_predictive_coding
Compensationhttps://en.wikipedia.org/wiki/Motion_compensation
Estimationhttps://en.wikipedia.org/wiki/Motion_estimation
Vectorhttps://en.wikipedia.org/wiki/Motion_vector
Psychoacoustichttps://en.wikipedia.org/wiki/Psychoacoustics
Audiohttps://en.wikipedia.org/wiki/Data_compression#Audio
Bit ratehttps://en.wikipedia.org/wiki/Bit_rate
ABRhttps://en.wikipedia.org/wiki/Average_bitrate
CBRhttps://en.wikipedia.org/wiki/Constant_bitrate
VBRhttps://en.wikipedia.org/wiki/Variable_bitrate
Compandinghttps://en.wikipedia.org/wiki/Companding
Convolutionhttps://en.wikipedia.org/wiki/Convolution
Dynamic rangehttps://en.wikipedia.org/wiki/Dynamic_range
Latencyhttps://en.wikipedia.org/wiki/Latency_(audio)
Nyquist–Shannon theoremhttps://en.wikipedia.org/wiki/Nyquist–Shannon_sampling_theorem
Samplinghttps://en.wikipedia.org/wiki/Sampling_(signal_processing)
Silence compressionhttps://en.wikipedia.org/wiki/Silence_compression
Sound qualityhttps://en.wikipedia.org/wiki/Sound_quality
Speech codinghttps://en.wikipedia.org/wiki/Speech_coding
Sub-band codinghttps://en.wikipedia.org/wiki/Sub-band_coding
Codechttps://en.wikipedia.org/wiki/Audio_codec
A-lawhttps://en.wikipedia.org/wiki/A-law_algorithm
μ-lawhttps://en.wikipedia.org/wiki/Mu-law_algorithm
DPCMhttps://en.wikipedia.org/wiki/Differential_pulse-code_modulation
ADPCMhttps://en.wikipedia.org/wiki/Adaptive_differential_pulse-code_modulation
DMhttps://en.wikipedia.org/wiki/Delta_modulation
FThttps://en.wikipedia.org/wiki/Fourier_transform
FFThttps://en.wikipedia.org/wiki/Fast_Fourier_transform
LPChttps://en.wikipedia.org/wiki/Linear_predictive_coding
ACELPhttps://en.wikipedia.org/wiki/Algebraic_code-excited_linear_prediction
CELPhttps://en.wikipedia.org/wiki/Code-excited_linear_prediction
LARhttps://en.wikipedia.org/wiki/Log_area_ratio
LSPhttps://en.wikipedia.org/wiki/Line_spectral_pairs
WLPChttps://en.wikipedia.org/wiki/Warped_linear_predictive_coding
MDCThttps://en.wikipedia.org/wiki/Modified_discrete_cosine_transform
Psychoacoustic modelhttps://en.wikipedia.org/wiki/Psychoacoustics
Imagehttps://en.wikipedia.org/wiki/Image_compression
Chroma subsamplinghttps://en.wikipedia.org/wiki/Chroma_subsampling
Coding tree unithttps://en.wikipedia.org/wiki/Coding_tree_unit
Color spacehttps://en.wikipedia.org/wiki/Color_space
Compression artifacthttps://en.wikipedia.org/wiki/Compression_artifact
Image resolutionhttps://en.wikipedia.org/wiki/Image_resolution
Macroblockhttps://en.wikipedia.org/wiki/Macroblock
Pixelhttps://en.wikipedia.org/wiki/Pixel
PSNRhttps://en.wikipedia.org/wiki/Peak_signal-to-noise_ratio
Quantizationhttps://en.wikipedia.org/wiki/Quantization_(image_processing)
Standard test imagehttps://en.wikipedia.org/wiki/Standard_test_image
Texture compressionhttps://en.wikipedia.org/wiki/Texture_compression
Chain codehttps://en.wikipedia.org/wiki/Chain_code
DCThttps://en.wikipedia.org/wiki/Discrete_cosine_transform
Deflatehttps://en.wikipedia.org/wiki/Deflate
Fractalhttps://en.wikipedia.org/wiki/Fractal_compression
KLThttps://en.wikipedia.org/wiki/Karhunen–Loève_theorem
LPhttps://en.wikipedia.org/wiki/Pyramid_(image_processing)
RLEhttps://en.wikipedia.org/wiki/Run-length_encoding
Wavelethttps://en.wikipedia.org/wiki/Wavelet_transform
Daubechieshttps://en.wikipedia.org/wiki/Daubechies_wavelet
DWThttps://en.wikipedia.org/wiki/Discrete_wavelet_transform
EZWhttps://en.wikipedia.org/wiki/Embedded_zerotrees_of_wavelet_transforms
SPIHThttps://en.wikipedia.org/wiki/Set_partitioning_in_hierarchical_trees
Videohttps://en.wikipedia.org/wiki/Data_compression#Video
Bit ratehttps://en.wikipedia.org/wiki/Bit_rate
ABRhttps://en.wikipedia.org/wiki/Average_bitrate
CBRhttps://en.wikipedia.org/wiki/Constant_bitrate
VBRhttps://en.wikipedia.org/wiki/Variable_bitrate
Display resolutionhttps://en.wikipedia.org/wiki/Display_resolution
Framehttps://en.wikipedia.org/wiki/Film_frame
Frame ratehttps://en.wikipedia.org/wiki/Frame_rate
Frame typeshttps://en.wikipedia.org/wiki/Video_compression_picture_types
Interlacehttps://en.wikipedia.org/wiki/Interlaced_video
Video characteristicshttps://en.wikipedia.org/wiki/Video#Characteristics_of_video_streams
Video qualityhttps://en.wikipedia.org/wiki/Video_quality
Codechttps://en.wikipedia.org/wiki/Video_codec
DCThttps://en.wikipedia.org/wiki/Discrete_cosine_transform
DPCMhttps://en.wikipedia.org/wiki/Differential_pulse-code_modulation
Deblocking filterhttps://en.wikipedia.org/wiki/Deblocking_filter
Lapped transformhttps://en.wikipedia.org/wiki/Lapped_transform
Compensationhttps://en.wikipedia.org/wiki/Motion_compensation
Estimationhttps://en.wikipedia.org/wiki/Motion_estimation
Vectorhttps://en.wikipedia.org/wiki/Motion_vector
Wavelethttps://en.wikipedia.org/wiki/Wavelet_transform
Daubechieshttps://en.wikipedia.org/wiki/Daubechies_wavelet
DWThttps://en.wikipedia.org/wiki/Discrete_wavelet_transform
Theoryhttps://en.wikipedia.org/wiki/Information_theory
Compressed data structureshttps://en.wikipedia.org/wiki/Compressed_data_structure
Compressed suffix arrayhttps://en.wikipedia.org/wiki/Compressed_suffix_array
FM-indexhttps://en.wikipedia.org/wiki/FM-index
Entropyhttps://en.wikipedia.org/wiki/Entropy_(information_theory)
Information theoryhttps://en.wikipedia.org/wiki/Information_theory
Timelinehttps://en.wikipedia.org/wiki/Timeline_of_information_theory
Kolmogorov complexityhttps://en.wikipedia.org/wiki/Kolmogorov_complexity
Prefix codehttps://en.wikipedia.org/wiki/Prefix_code
Quantizationhttps://en.wikipedia.org/wiki/Quantization_(signal_processing)
Rate–distortionhttps://en.wikipedia.org/wiki/Rate–distortion_theory
Redundancyhttps://en.wikipedia.org/wiki/Redundancy_(information_theory)
Symmetryhttps://en.wikipedia.org/wiki/Data_compression_symmetry
Smallest grammar problemhttps://en.wikipedia.org/wiki/Smallest_grammar_problem
Hutter Prizehttps://en.wikipedia.org/wiki/Hutter_Prize
Mark Adlerhttps://en.wikipedia.org/wiki/Mark_Adler
David A. Huffmanhttps://en.wikipedia.org/wiki/David_A._Huffman
Phil Katzhttps://en.wikipedia.org/wiki/Phil_Katz
https://en.wikipedia.org/w/index.php?title=Huffman_coding&oldid=1379018579https://en.wikipedia.org/w/index.php?title=Huffman_coding&oldid=1379018579
Categorieshttps://en.wikipedia.org/wiki/Help:Category
1952 in computinghttps://en.wikipedia.org/wiki/Category:1952_in_computing
Lossless compression algorithmshttps://en.wikipedia.org/wiki/Category:Lossless_compression_algorithms
Binary treeshttps://en.wikipedia.org/wiki/Category:Binary_trees
Data compressionhttps://en.wikipedia.org/wiki/Category:Data_compression
Articles with short descriptionhttps://en.wikipedia.org/wiki/Category:Articles_with_short_description
Short description is different from Wikidatahttps://en.wikipedia.org/wiki/Category:Short_description_is_different_from_Wikidata
Use dmy dates from May 2019https://en.wikipedia.org/wiki/Category:Use_dmy_dates_from_May_2019
Articles needing additional references from December 2021https://en.wikipedia.org/wiki/Category:Articles_needing_additional_references_from_December_2021
All articles needing additional referenceshttps://en.wikipedia.org/wiki/Category:All_articles_needing_additional_references
CS1 location testhttps://en.wikipedia.org/wiki/Category:CS1_location_test
All articles with unsourced statementshttps://en.wikipedia.org/wiki/Category:All_articles_with_unsourced_statements
Articles with unsourced statements from June 2025https://en.wikipedia.org/wiki/Category:Articles_with_unsourced_statements_from_June_2025
Articles with unsourced statements from December 2021https://en.wikipedia.org/wiki/Category:Articles_with_unsourced_statements_from_December_2021
Commons category link is on Wikidatahttps://en.wikipedia.org/wiki/Category:Commons_category_link_is_on_Wikidata
Parsoidhttps://www.mediawiki.org/wiki/Special:MyLanguage/Parsoid
Creative Commons Attribution-ShareAlike 4.0 Licensehttps://en.wikipedia.org/wiki/Wikipedia:Text_of_the_Creative_Commons_Attribution-ShareAlike_4.0_International_License
Terms of Usehttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use
Privacy Policyhttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy
Wikimedia Foundation, Inc.https://wikimediafoundation.org/
Privacy policyhttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy
About Wikipediahttps://en.wikipedia.org/wiki/Wikipedia:About
Disclaimershttps://en.wikipedia.org/wiki/Wikipedia:General_disclaimer
Contact Wikipediahttps://en.wikipedia.org/wiki/Wikipedia:Contact_us
Legal & safety contactshttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Legal:Wikimedia_Foundation_Legal_and_Safety_Contact_Information
Code of Conducthttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct
Developershttps://developer.wikimedia.org
Statisticshttps://stats.wikimedia.org/#/en.wikipedia.org
Cookie statementhttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement
Mobile viewhttps://en.wikipedia.org/w/index.php?title=Huffman_coding&mobileaction=toggle_view_mobile
https://www.wikimedia.org/
https://www.mediawiki.org/
https://en.wikipedia.org/wiki/Huffman_coding
https://en.wikipedia.org/wiki/Huffman_coding
https://en.wikipedia.org/wiki/Huffman_coding
https://en.wikipedia.org/wiki/Huffman_coding
https://en.wikipedia.org/wiki/Huffman_coding
https://en.wikipedia.org/wiki/Huffman_coding
https://en.wikipedia.org/wiki/Huffman_coding
Add topic https://en.wikipedia.org/wiki/Huffman_coding

Viewport: width=1120

Robots: max-image-preview:standard

URLs of crawlers that visited me.