Une famille remarquable de codes indecomposables

DOI10.1007/3-540-08860-1_9MaRDI QIDQ4187734zbMATH OpenOpenAlexFDO

Authors Jean-Marie Boë

Publication date 1978

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-08860-1_9

zbMATH Keywords

finite uniquely decodable codesindecomposable codes

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45) Other types of codes (94B60)

Recommendations

• On codes having no finite completion
• scientific article; zbMATH DE number 1414301
• scientific article; zbMATH DE number 176765
• scientific article; zbMATH DE number 3928880
• On codes having no finite completion

Cited in

(10)

• Construction de codes factorisants
• Noncommutative factorization of variable-length codes
• Synchronization and decomposability for a family of codes. II
• On factorizing codes: Structural properties and related decision problems
• A note on the factorization conjecture
• On a complete set of operations for factorizing codes
• scientific article; zbMATH DE number 3905865 (Why is no real title available?)
• scientific article; zbMATH DE number 3559597 (Why is no real title available?)
• Finite maximal codes and factorizations of cyclic groups
• A three-word code which is not prefix-suffix composed

This page was built for publication: Une famille remarquable de codes indecomposables

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