On the factorization of codes
A code is a free subset of a free monoid. We show that a subset \(C\) of the free monoid \(X^*\) on the finite alphabet \(X\) is a finite and maximal code if and only if its characteristic polynomial \(\mathcal C\), element of the free associative algebra \(\mathbb Z<X>\) on \(X\), verifies \(\mathcal C-1=P(X-1)S\) for some polynomials \(P, S\) in \(\mathbb Z<X>\). This gives a partial answer to the factorization conjecture of Schützenberger \((P, S\) should moreover have nonnegative coefficients). A stronger result, which is the noncommutative version of \textit{M. P. Schützenberger}'s factorization theorem [Bull. Soc. Math. Fr. 93, 203--223 (1965; Zbl 0149.02601)], is to appear in [J. Pure Appl. Algebra 36, 167--185 (1985; Zbl 0629.68079)].
- Construction de codes factorisants
- Noncommutative factorization of variable-length codes
- Construction of a family of finite maximal codes
- A partial result about the factorization conjecture for finite variable- length codes
- Hajós factorizations and completion of codes.
- On some Schützenberger conjectures
- On factorizing codes: Structural properties and related decision problems
- An enhanced property of factorizing codes
- A note on the factorization conjecture
- Hypercube 1-factorizations from extended Hamming codes
- Factorizing The Polynomial of a Code
- scientific article; zbMATH DE number 3854450 (Why is no real title available?)
- scientific article; zbMATH DE number 3861454 (Why is no real title available?)
- On a complete set of operations for factorizing codes
- scientific article; zbMATH DE number 3985118 (Why is no real title available?)
- scientific article; zbMATH DE number 4043285 (Why is no real title available?)
- Codes limites et factorisations finies du monoïde libre
- On $z$-submonoids and $z$-codes
- SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
- scientific article; zbMATH DE number 1740158 (Why is no real title available?)
- scientific article; zbMATH DE number 1047958 (Why is no real title available?)
- scientific article; zbMATH DE number 1759416 (Why is no real title available?)
- Ensembles libres de chemins dans un graphe
- scientific article; zbMATH DE number 3999313 (Why is no real title available?)
- scientific article; zbMATH DE number 2114221 (Why is no real title available?)
- Shortening Array Codes and the Perfect $1$-Factorization Conjecture
- On the factorization conjecture
- Finite maximal codes and factorizations of cyclic groups
This page was built for publication: On the factorization of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796308)
