On McMillan's theorem about uniquely decipherable codes

Details On McMillan's theorem about uniquely decipherable codes On McMillan's theorem about uniquely decipherable codes

2008-06-19

arxiv.org/abs/0806.3277v2

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On McMillan's theorem about uniquely decipherable codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On McMillan's theorem about uniquely decipherable codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On McMillan's theorem about uniquely decipherable codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-370541