On McMillan's theorem about uniquely decipherable codes

Simple item page
dc.creatorFoldes, Stephan
dc.date2008-06-19
dc.date2008-06-21
dc.date.accessioned2026-07-07T09:45:49Z
dc.date.available2026-07-07T09:45:49Z
dc.descriptionKarush'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.
dc.identifierhttps://arxiv.org/abs/0806.3277
dc.identifierhttp://arxiv.org/abs/0806.3277
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163323
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subject05E99, 94A45, 20M05
dc.titleOn McMillan's theorem about uniquely decipherable codes
dc.typetext

Files

Collections

arXiv