FULL MONOIDS AND MAXIMAL CODES

DOI10.1142/S0129054112400692zbMath1285.68098OpenAlexW2075961016MaRDI QIDQ2841976

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

uniquely decipherable codecoding partitionfree product of monoids

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: FULL MONOIDS AND MAXIMAL CODES