Full monoids and maximal codes

DOI10.1142/S0129054112400692MaRDI QIDQ2841976zbMATH OpenOpenAlexFDO

Authors Fabio Burderi

Publication date 30 July 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054112400692

zbMATH Keywords

coding partitionfree product of monoidsuniquely decipherable code

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15)

Recommendations

• Monoids and maximal codes
• scientific article; zbMATH DE number 3926268
• On codes having no finite completions
• scientific article; zbMATH DE number 1552695
• Maximality of codes in free monoids

Cites work

• A note on multiset decipherable codes
• Coding partitions of regular sets
• Deciding multiset decipherability
• Decipherability of codes
• Each regular code is included in a maximal regular code
• On multiset decipherable codes (Corresp.)
• The finest homophonic partition and related code concepts
• Varieties of codes and Kraft inequality

Cited in

(8)

• Maximality of codes in free monoids
• Monoids and maximal codes
• scientific article; zbMATH DE number 3952655 (Why is no real title available?)
• scientific article; zbMATH DE number 1552695 (Why is no real title available?)
• Coding and strong coding in trace monoids
• Monomial-Cartesian codes closed under divisibility
• Free product of formal series
• Factorizations and monoids

This page was built for publication: Full monoids and maximal codes

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