Une famille remarquable de codes indecomposables

DOI10.1007/3-540-08860-1_9zbMATH Open0402.94036OpenAlexW1592134757MaRDI QIDQ4187734FDOQ4187734

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

Recommendations

• On codes having no finite completion
• Publication:4942638
• scientific article; zbMATH DE number 176765
• scientific article; zbMATH DE number 3928880
• On codes having no finite completion

zbMATH Keywords

indecomposable codesfinite uniquely decodable codes

Mathematics Subject Classification ID

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

Cited In (10)

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

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)