On McMillan's theorem about uniquely decipherable codes
classification
🧮 math.CO
cs.ITmath.IT
keywords
mcmillantheoremcodesargumentcertaindecipherableevaluationsindeterminates
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.