Back to Search
Start Over
On McMillan's theorem about uniquely decipherable codes
- Publication Year :
- 2008
-
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.
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.0806.3277
- Document Type :
- Working Paper