On the factorization conjecture

DOI10.1007/3-540-55210-3_211MaRDI QIDQ5096809zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A partial result about the factorization conjecture for finite variable- length codes
• A note on the factorization conjecture
• Construction de codes factorisants
• Publication:4725767
• On some Schützenberger conjectures

Cites work

• A counterexample to the triangle conjecture
• A general class of resource tradeoffs
• Codes asynchrones
• Construction of a family of finite maximal codes
• Factorizing The Polynomial of a Code
• scientific article; zbMATH DE number 3861454 (Why is no real title available?)
• scientific article; zbMATH DE number 3905865 (Why is no real title available?)
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3760085 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3999313 (Why is no real title available?)
• scientific article; zbMATH DE number 3024723 (Why is no real title available?)
• Noncommutative factorization of variable-length codes
• On codes having no finite completions
• On the factorization of codes
• Sur le problème de factorisation des groupes cycliques
• Sur un algorithme donnant les codes bipréfixes finis
• Synchronization and decomposability for a family of codes. II

Cited in

(26)

• On a problem of Oppenheim concerning Factorisatio Numerorum
• Construction de codes factorisants
• A conjecture on continued fractions
• An alternative formulation of the factorization conjecture for codes
• A partial result about the factorization conjecture for finite variable- length codes
• Hajós factorizations and completion of codes.
• On the necessity and sufficiency of \(PLUS\) factorizations
• On some Schützenberger conjectures
• Synchronization and decomposability for a family of codes. II
• Punishing factors and Chua's conjecture
• A note on the factorization conjecture
• Factorizing The Polynomial of a Code
• scientific article; zbMATH DE number 3975852 (Why is no real title available?)
• scientific article; zbMATH DE number 3985118 (Why is no real title available?)
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
• scientific article; zbMATH DE number 1047910 (Why is no real title available?)
• scientific article; zbMATH DE number 2044502 (Why is no real title available?)
• scientific article; zbMATH DE number 6862137 (Why is no real title available?)
• scientific article; zbMATH DE number 3999313 (Why is no real title available?)
• scientific article; zbMATH DE number 1885143 (Why is no real title available?)
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• scientific article; zbMATH DE number 962253 (Why is no real title available?)
• Conjectures as to a factor of 2^P ± 1
• Finite maximal codes and triangle conjecture
• On the factorization of codes
• A proof of the Pfister factor conjecture

This page was built for publication: On the factorization conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096809)