Huffman - Revision history

AConverse: Video Link

2009-02-16T03:50:32Z

Video Link

← Older revision		Revision as of 20:50, 15 February 2009
Line 1:		Line 1:
	'''Huffman coding''' is an [[entropy encoding]] algorithm used for [[lossless compression\|lossless data compression]]. The term refers to the use of a variable length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.		'''Huffman coding''' is an [[entropy encoding]] algorithm used for [[lossless compression\|lossless data compression]]. The term refers to the use of a variable length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.

			Huffman code generation is explained at 36:13 in Lecture 3 of [http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-450Fall-2006/VideoLectures/index.htm MIT 6.450].

	[[Category:Compression Theory]]		[[Category:Compression Theory]]

DonDiego: link fix

2007-06-04T09:57:33Z

link fix

← Older revision		Revision as of 02:57, 4 June 2007
Line 1:		Line 1:
	'''Huffman coding''' is an [[entropy encoding]] algorithm used for [[lossless data compression]]. The term refers to the use of a variable length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.		'''Huffman coding''' is an [[entropy encoding]] algorithm used for [[lossless compression\|lossless data compression]]. The term refers to the use of a variable length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.


	[[Category:Compression Theory]]		[[Category:Compression Theory]]

Aaniyo at 06:57, 2 February 2007

2007-02-02T06:57:28Z

← Older revision		Revision as of 23:57, 1 February 2007
Line 1:		Line 1:
	'''Huffman coding''' is an [[entropy encoding]] algorithm used for [[lossless data compression]]. The term refers to the use of a variable length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.		'''Huffman coding''' is an [[entropy encoding]] algorithm used for [[lossless data compression]]. The term refers to the use of a variable length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.


			[[Category:Compression Theory]]

Aaniyo at 06:45, 2 February 2007

2007-02-02T06:45:34Z

New page

'''Huffman coding''' is an [[entropy encoding]] algorithm used for [[lossless data compression]]. The term refers to the use of a variable length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.