Completing codes

DOI10.1051/ita/1989230201351zbMath0669.94012MaRDI QIDQ3823514

Antonio Restivo, Sergio Salemi, T. Sportelli

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 code; factorizations of cyclic groups

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

20K01: Finite abelian groups

94B15: Cyclic codes

Related Items

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

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