Construction de codes factorisants
From MaRDI portal
Motivated by the factorization conjecture of Schützenberger, we construct all finite maximal codes \(C\subseteq A^*\) which admit a factorization of the form \(C-1=P(A-1)(1+w),\) for some word w and some finite subset P of \(A^*\).
Recommendations
Cites work
- scientific article; zbMATH DE number 3861454 (Why is no real title available?)
- scientific article; zbMATH DE number 3898259 (Why is no real title available?)
- scientific article; zbMATH DE number 3905865 (Why is no real title available?)
- On the factorization of codes
- Une famille remarquable de codes indecomposables
Cited in
(9)- An alternative formulation of the factorization conjecture for codes
- On some Schützenberger conjectures
- A note on the factorization conjecture
- scientific article; zbMATH DE number 3985118 (Why is no real title available?)
- scientific article; zbMATH DE number 1047910 (Why is no real title available?)
- scientific article; zbMATH DE number 2044502 (Why is no real title available?)
- scientific article; zbMATH DE number 3999313 (Why is no real title available?)
- On the factorization conjecture
- FINITE COMPLETIONS VIA FACTORIZING CODES
This page was built for publication: Construction de codes factorisants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081306)