On McMillan's theorem about uniquely decipherable codes
Stephan Foldes · arXiv (Cornell University) · 2008
Karush's proof of McMillan's theorem is recast as an argument involving polynomials with non-commuting indeterminates certain evaluations of which yield the Kraft sums of codes, proving a strengthened version of McMillan's theorem.