Some decompositions of Bernoulli sets and codes

Aldo de Luca

Displaying similar documents to “Some decompositions of Bernoulli sets and codes”

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)....

Completing codes

A. Restivo, S. Salemi, T. Sportelli (1989)

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

Similarity:

On $z$ -submonoids and $z$ -codes

M. Madonia, S. Salemi, T. Sportelli (1991)

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

Similarity:

Polypodic codes

Symeon Bozapalidis, Olympia Louscou–Bozapalidou (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.

Finitary codes for biinfinite words

J. Devolder, E. Timmerman (1992)

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

Similarity:

On extremal additive $𝔽_{4}$ codes of length $10$ to $18$

Christine Bachoc, Philippe Gaborit (2000)

Journal de théorie des nombres de Bordeaux

Similarity:

In this paper we consider the extremal even self-dual $𝔽_{4}$ -additive codes. We give a complete classification for length $10$ . Under the hypothesis that at least two minimal words have the same support, we classify the codes of length $14$ and we show that in length $18$ such a code is equivalent to the unique $𝔽_{4}$ -hermitian code with parameters [18,9,8]. We construct with the help of them some extremal $3$ -modular lattices.

Some results on finite maximal codes

Clelia De Felice, Antonio Restivo (1985)

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

Similarity:

Maximal circular codes maximal codes

Yannick Guesnet (2010)

RAIRO - Theoretical Informatics and 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.