On the factorization conjecture

DOI10.1007/3-540-55210-3_211zbMath1494.68134OpenAlexW1513453553MaRDI QIDQ5096809

Clelia De Felice

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_211

Mathematics Subject Classification ID

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

Related Items

Synchronization and decomposability for a family of codes. II ⋮ Hajós factorizations and completion of codes. ⋮ A partial result about the factorization conjecture for finite variable- length codes

Cites Work

• A counterexample to the triangle conjecture
• On the factorization of codes
• Noncommutative factorization of variable-length codes
• Construction of a family of finite maximal codes
• On codes having no finite completions
• A general class of resource tradeoffs
• Synchronization and decomposability for a family of codes. II
• Factorizing The Polynomial of a Code
• Codes asynchrones
• Sur un algorithme donnant les codes bipréfixes finis
• 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