Revision as of 16:41, 16 March 2017 edit A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,580 edits example of uniquely decodable codes that are not prefix codes ← Previous edit		Revision as of 00:33, 26 June 2017 edit undo PrimeBOT (talk \| contribs) Bots 2,129,981 edits m Replace magic links with templates per local RfC - BRFA Next edit →
Line 63: * D.A. Huffman, "A method for the construction of minimum-redundancy codes", Proceedings of the I.R.E., Sept. 1952, pp. 1098–1102 (Huffman's original article) * [http://www.huffmancoding.com/david/scientific.html Profile: David A. Huffman], [[Scientific American]], Sept. 1991, pp. 54–58 (Background story) * [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Second Edition. MIT Press and McGraw-Hill, 2001. {{ISBN \|0-262-03293-7}}. Section 16.3, pp. 385–392. * {{FS1037C}}

Prefix code: Difference between revisions