Construction of a family of finite maximal codes

DOI10.1016/0304-3975(89)90076-5zbMath0667.68079OpenAlexW2131692308MaRDI QIDQ1117704

Clelia De Felice

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90076-5

zbMATH Keywords

polynomial factorizationfinite maximal codesfactorization of Z/nZfactorizing code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (17)

On factorizing codes: Structural properties and related decision problems ⋮ Synchronization and decomposability for a family of codes. II ⋮ On the factorization conjecture ⋮ Hajós factorizations and completion of codes. ⋮ On codes having no finite completion ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ An enhanced property of factorizing codes ⋮ On codes with a finite deciphering delay: Constructing uncompletable words ⋮ A note on the factorization conjecture ⋮ Embedding a \(\theta \)-invariant code into a complete one ⋮ Finite maximal codes and triangle conjecture ⋮ On a complete set of operations for factorizing codes ⋮ On codes having no finite completion ⋮ On some Schützenberger conjectures ⋮ A partial result about the factorization conjecture for finite variable- length codes ⋮ A non-ambiguous decomposition of regular languages and factorizing codes ⋮ ON A PROPERTY OF THE FACTORIZING CODES

Cites Work

• On the factorization of codes
• Noncommutative factorization of variable-length codes
• On codes having no finite completions
• Completing codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of a family of finite maximal codes