A Weak Structural Form of Commutative Equivalence in Finite Codes

Dean Kraizberg

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 establ…