Synchronization and decomposability for a family of codes. II

DOI10.1016/0012-365X(94)E0138-8zbMath0842.94009OpenAlexW2157071601MaRDI QIDQ1893165

Véronique Bruyère, Clelia De Felice

Publication date: 24 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)e0138-8

zbMATH Keywords

factorizationsvariable length code

Mathematics Subject Classification ID

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

Related Items (5)

On factorizing codes: Structural properties and related decision problems ⋮ On the factorization conjecture ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ On a complete set of operations for factorizing codes ⋮ ON A PROPERTY OF THE FACTORIZING CODES

Cites Work

• Noncommutative factorization of variable-length codes
• Construction of a family of finite maximal codes
• On codes having no finite completions
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
• Codes asynchrones
• Une famille remarquable de codes indecomposables
• On the factorization conjecture
• Sur le problème de factorisation des groupes cycliques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronization and decomposability for a family of codes. II