Decipherability of codes

DOI10.1016/S0022-4049(98)00019-XMaRDI QIDQ1304888zbMATH OpenOpenAlexFDO

Authors F. 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

codesGalois connectionmonoidsvarieties of monoidsuniquely decipherable codesmultiset decipherable codesset decipherable codessimplified domino graph

Mathematics Subject Classification ID

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

Recommendations

• Domino graphs and the decipherability of directed figure codes
• Monoids and maximal codes
• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• Decidability of multiset, set and numerically decipherable directed figure codes
• Deciding multiset decipherability

Cited in

(17)

• Unique decipherability in formal languages
• STACS 2005
• Coding by minimal linear grammars
• Note on decipherability of three-word codes
• Decoding Gentzen's Notation
• Full monoids and maximal codes
• One-relation languages and code generators
• Multiset and set decipherable codes
• Coding partitions of regular sets
• WERE THE JAPANESE ARMY CODES SECURE?
• Unique decipherability in the additive monoid of sets of numbers
• On numerically decipherable codes and their homophonic partitions
• Decoding the Golay codes
• scientific article; zbMATH DE number 3928874 (Why is no real title available?)
• Code Reverse Engineering Problem for Identification Codes
• On Unique Decodability
• Codes, orderings, and partial words

This page was built for publication: Decipherability of codes

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