Huffman coding
id:
huffman-coding-205-5918318
title:
Huffman coding
text:
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code is Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes". The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symb
brand slug:
wiki
category slug:
encyclopedia
description:
Technique to compress data
original url:
https://en.wikipedia.org/wiki/Huffman_coding
date created:
2001-10-30T15:10:22Z
date modified:
2024-09-10T19:02:39Z
main entity:
{"identifier":"Q2647","url":"https://www.wikidata.org/entity/Q2647"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/82/Huffman_tree_2.svg","width":625,"height":402}
fields total:
13
integrity:
16