Construction of a family of finite maximal codes

DOI10.1016/0304-3975(89)90076-5zbMath0667.68079MaRDI 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 factorization; finite maximal codes; factorization of Z/nZ; factorizing code

Mathematics Subject Classification ID

68Q45: Formal languages and automata

94A45: Prefix, length-variable, comma-free codes

Related Items

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

Cites Work

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