1999
DOI: 10.1142/s0218196799000217
|View full text |Cite
|
Sign up to set email alerts
|

On a Property of the Factorizing Codes

Abstract: In this paper we consider factorizing codes C over A, i.e. codes verifying the factorization conjecture by Schutzenberger. We give a description of the structure of the words in C D a* (A\a)a*, a being a letter in A, by using a class of factorizations of the cyclic groups discovered by Hajos.'Partially supported by Project 40% MURST "Efficienza di Algoritmi e Progetto di Strutture Informative", Project 60% MURST and by "Gruppo Nazionale per l'lnformatica Matematica (GNIM)".

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2001
2001
2022
2022

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…In fact we can point out that this arrangement has additional properties, through the notion of a good arrangement of a set. This is a slightly technical notion introduced in [13,15]. Roughly, it is an arrangement of its words in a matrix that can be recursively constructed thanks to the recursive constructions of the pairs (R h , T k ).…”
Section: Good Arrangementsmentioning
confidence: 99%
“…In fact we can point out that this arrangement has additional properties, through the notion of a good arrangement of a set. This is a slightly technical notion introduced in [13,15]. Roughly, it is an arrangement of its words in a matrix that can be recursively constructed thanks to the recursive constructions of the pairs (R h , T k ).…”
Section: Good Arrangementsmentioning
confidence: 99%
“…In a series of papers of C. De Felice the Hajós property has featured prominently. (For example [2,3]. See also [4].)…”
Section: Conjecturementioning
confidence: 99%