Construction de codes factorisants (Q1081306)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3970119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction de codes factorisants |
scientific article; zbMATH DE number 3970119 |
Statements
Construction de codes factorisants (English)
0 references
1985
0 references
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^*\).
0 references
finite maximal codes
0 references
factorization
0 references
0.9259724617004396
0 references
0.9008405208587646
0 references
0.8932720422744751
0 references
