Coding partitions

MaRDI QIDQ5387722zbMATH OpenFDO

Authors Fabio Burderi, Antonio Restivo

Publication date 27 May 2008

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/86/showToc.html

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Combinatorics in computer science (68R05) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Coding Partitions: Regularity, Maximality and Global Ambiguity
• Coding partitions of regular sets
• scientific article; zbMATH DE number 1740158
• A novel test for unique decipherability of codes
• The finest homophonic partition and related code concepts

Cited in

(11)

• Coding by minimal linear grammars
• On numerically decipherable codes and their homophonic partitions
• Finding tailored partitions
• Coding partitions of regular sets
• Factorization in formal languages
• Multilevel codes based on partitioning
• Relativized codes
• The finest homophonic partition and related code concepts
• Coding Partitions: Regularity, Maximality and Global Ambiguity
• Free product of formal series
• Factorizations and monoids

This page was built for publication: Coding partitions

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