Completing codes

DOI10.1051/ITA/1989230201351zbMath0669.94012OpenAlexW4232006565MaRDI QIDQ3823514

T. Sportelli, Sergio Salemi, Antonio Restivo

Publication date: 1989

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92327

zbMATH Keywords

finite maximal codefactorizations of cyclic groups

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Finite abelian groups (20K01) Cyclic codes (94B15)

Related Items (25)

On factorizing codes: Structural properties and related decision problems ⋮ A note on codes having no finite completions ⋮ A first step in characterizing three-element codes ⋮ Construction of a family of finite maximal codes ⋮ Hajós factorizations and completion of codes. ⋮ On the proportion of prefix codes in the set of three-element codes ⋮ A QUESTION CONCERNING THE FACTORIZATION OF CYCLIC GROUPS ⋮ The second step in characterizing a three-word code ⋮ On the length of uncompletable words in unambiguous automata ⋮ On codes having no finite completion ⋮ On maximal synchronous codes. ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ A three-word code which is not prefix-suffix composed ⋮ An application of Hajós factorizations to variable-length codes ⋮ Completing circular codes in regular submonoids ⋮ An enhanced property of factorizing codes ⋮ On codes with a finite deciphering delay: Constructing uncompletable words ⋮ Completing codes and the Rédei property of groups ⋮ A note on the factorization conjecture ⋮ Embedding a \(\theta \)-invariant code into a complete one ⋮ On a complete set of operations for factorizing codes ⋮ FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS ⋮ On codes having no finite completion ⋮ Locally complete sets and finite decomposable codes ⋮ ON A PROPERTY OF THE FACTORIZING CODES

Cites Work

• A counterexample to the triangle conjecture
• On codes having no finite completions
• Each regular code is included in a maximal regular code
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completing codes