2000 character limit reached
The Kraft sum as a monotone function on the refinement-ordered set of uniquely decipherable codes
Published 17 May 2013 in math.CO | (1305.4141v2)
Abstract: The set of all uniquely decipherable (UD) codes is partially ordered by refinement, meaning that all strings in the cruder code can be represented as concatenations of strings taken from the finer code. The Kraft sum is a monotone (increasing) function on this poset. In the refinement order, chains of UD codes having the same Kraft sum are necessarily of the simple sequence type. A characterization of UD codes in terms of equalities involving Kraft sums is also given.
Paper Prompts
Sign up for free to create and run prompts on this paper.