Displaying similar documents to “A decoding scheme for the 4-ary lexicodes with D = 3 .”

Maximal circular codes versus maximal codes

Yannick Guesnet (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.

On a complete set of operations for factorizing codes

Clelia De Felice (2006)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set 𝒪 of operations exists such that each factorizing code can be obtained by using the operations in 𝒪 and starting with prefix or suffix codes. 𝒪 is named here a complete set of operations (for factorizing codes)....

The code problem for directed figures

Michał Kolarz (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

We consider directed figures defined as labelled polyominoes with designated start and end points, with two types of catenation operations. We are especially interested in codicity verification for sets of figures, and we show that depending on the catenation type the question whether a given set of directed figures is a code is decidable or not. In the former case we give a constructive proof which leads to a straightforward algorithm.

A hierarchy for circular codes

Giuseppe Pirillo (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

We first prove an extremal property of the infinite Fibonacci word : the family of the palindromic prefixes {} of is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two important classes of codes, the comma-free codes and the circular ones.