Decipherability of codes

DOI10.1016/S0022-4049(98)00019-XzbMath0940.94004OpenAlexW2049048592MaRDI QIDQ1304888

Fernando Guzmán

Publication date: 25 July 2000

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-4049(98)00019-x

zbMATH Keywords

Galois connectionmonoidscodesvarieties of monoidsuniquely decipherable codesmultiset decipherable codesset decipherable codessimplified domino graph

Mathematics Subject Classification ID

Combinatorics on words (68R15) Lattices of varieties (08B15) Varieties and pseudovarieties of semigroups (20M07) Prefix, length-variable, comma-free codes (94A45) Lattices (06B99)

Related Items (8)

On numerically decipherable codes and their homophonic partitions ⋮ Coding by minimal linear grammars ⋮ Codes, orderings, and partial words ⋮ Multiset and set decipherable codes ⋮ Unique decipherability in formal languages ⋮ CODING PARTITIONS OF REGULAR SETS ⋮ FULL MONOIDS AND MAXIMAL CODES ⋮ One-relation languages and code generators

This page was built for publication: Decipherability of codes