On McMillan's theorem about uniquely decipherable codes
Combinatorics
2008-06-23 v2 Information Theory
math.IT
Abstract
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.
Cite
@article{arxiv.0806.3277,
title = {On McMillan's theorem about uniquely decipherable codes},
author = {Stephan Foldes},
journal= {arXiv preprint arXiv:0806.3277},
year = {2008}
}