Revision as of 16:24, 29 July 2017 edit Joepie91 (talk \| contribs) 23 edits Clarified that words are only uniquely identifiable if the sequence is complete and accurate ← Previous edit		Revision as of 19:38, 13 March 2018 edit undo JCW-CleanerBot (talk \| contribs) Bots 137,069 edits m →References: task, replaced: IEEE Trans. Inform. Theory → IEEE Trans. Inf. Theory using AWB Next edit →
Line 60: ==References== * {{cite book \| last1=Berstel \| first1=Jean \| last2=Perrin \| first2=Dominique \| last3=Reutenauer \| first3=Christophe \| title=Codes and automata \| series=Encyclopedia of Mathematics and its Applications \| volume=129 \| ___location=Cambridge \| publisher=[[Cambridge University Press]] \| year=2010 \| url=http://www-igm.univ-mlv.fr/~berstel/LivreCodes/Codes.html \| isbn=978-0-521-88831-8 \| zbl=1187.94001 }} * {{cite journal \| last=Elias \| first=Peter \| authorlink=Peter Elias \| title=Universal codeword sets and representations of the integers \| journal=IEEE Trans. ~~Inform~~Inf. Theory \| volume=21 \| number=2 \| year=1975 \| pages=194–203 \| issn=0018-9448 \| zbl=0298.94011 }} * 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)

Prefix code: Difference between revisions