A Weak Structural Form of Commutative Equivalence in Finite Codes
Provides a structural insight into the commutative equivalence conjecture for finite codes, but the result is incremental and theoretical.
The paper establishes a canonical correspondence between prefix-free binary codes and symmetric trees, preserving codeword lengths and additional commutative structure, and proves a result related to the commutative equivalence conjecture: for every code, there exists a prefix-free code with equal sums of powers of two for each word length.
We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establish a canonical correspondence between prefix-free codes and symmetric trees, preserving not only the lengths of codewords but also some additional commutative structure. Using this correspondence, we provide a result related to the commutative equivalence conjecture. We show that for every code, there exists a prefix-free code such that, for each fixed word length, the sums of powers of two determined by the occurrences of a distinguished symbol are equal.