论文信息 - Noncommutative factorization of variable-length codes

Noncommutative factorization of variable-length codes

Abstract We prove a noncommutative version of a theorem of Schutzenberger on the factorization of variable-length codes. As consequences, we obtain a positive answer to a weak form of the `factorization conjecture, a complete characterization of maximal and finite codes and a noncommutative extension of an invariance property due to Hansel and Perrin.

Christophe Reutenauer | C. Reutenauer

[1] M. Schützenberger,et al. Sur certains sous-monoïdes libres , 1965 .

[2] G. Hansel. Baionnettes et cardinaux , 1982, Discret. Math..

[3] Factorizing the polynomial of a code , 1984 .

[4] G. Lallement. Semigroups and combinatorial applications , 1979 .

[5] P. Cohn. The Universal Field of Fractions of a Semifir I. Numerators and Denominators , 1982 .

[6] Peter W. Shor,et al. A Counterexample to the Triangle Conjecture , 1985, J. Comb. Theory, Ser. A.

[7] Antonio Restivo,et al. On codes having no finite completions , 1977, Discret. Math..

[8] R. Lyndon,et al. Combinatorial Group Theory , 1977 .

[9] Antonio Restivo,et al. Minimal Complete Sets of Words , 1980, Theor. Comput. Sci..

[10] Antonio Restivo,et al. A Family of Codes Commutatively Equivalent to Prefix Codes , 1981, Inf. Process. Lett..

[11] Marcel Paul Schützenberger,et al. A conjecture on sets of differences of integer pairs , 1981, J. Comb. Theory, Ser. B.

[12] Imre Simon,et al. A Note on the Triangle Conjecture , 1982, J. Comb. Theory, Ser. A.

[13] Clelia de Felice. On the Triangle Conjecture , 1982, Inf. Process. Lett..

[14] François Blanchard,et al. Relèvement d'une mesure ergodique par un codage , 1980 .

[15] P. Cohn. Free Associative Algebras , 1969 .

[16] P. Cohn. Free rings and their relations , 1973 .