Factorizing The Polynomial of a Code

DOI10.2307/1999474MaRDI QIDQ3220763zbMATH OpenOpenAlexFDO

Authors Georges Hansel, Dominique Perrin, Christophe Reutenauer

Publication date 1984

Full work available at URL https://doi.org/10.2307/1999474

zbMATH Keywords

alphabetcodesfinite maximal codeunique decompositionword

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)

Recommendations

• On the factorization of codes
• Noncommutative factorization of variable-length codes
• Publication:4725767
• On the factorization conjecture
• A note on the factorization conjecture

Cites work

• Codes and Bernoulli partitions
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• Sur certains sous-monoïdes libres

Cited in

(4)

• Noncommutative factorization of variable-length codes
• Polynomials generating Hamming codes
• On the factorization conjecture
• On the factorization of codes

This page was built for publication: Factorizing The Polynomial of a Code

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