pith. sign in

arxiv: 1305.4141 · v2 · pith:SARRIFWJnew · submitted 2013-05-17 · 🧮 math.CO

The Kraft sum as a monotone function on the refinement-ordered set of uniquely decipherable codes

classification 🧮 math.CO
keywords codeskraftcodedecipherablefunctionmonotonerefinementstrings
0
0 comments X
read the original 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.

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.