Note on decipherability of three-word codes

DOI10.1155/S0161171202011729MaRDI QIDQ1608195zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 12 August 2002

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/49741, http://www.hindawi.com/journals/ijmms/volume-30/S0161171202011729.html

zbMATH Keywords

uniquely decipherable codesmultiset decipherable codesdomino techniquesset-decipherable codes

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Prefix, length-variable, comma-free codes (94A45) Combinatorics on words (68R15) Decoding (94B35)

Recommendations

• On unique, multiset, and set decipherability of three-word codes
• scientific article; zbMATH DE number 1740158
• Multiset and set decipherable codes
• Decipherability of codes
• On multiset decipherable codes (Corresp.)

Cited in

(5)

• Multiset and set decipherable codes
• On multiset decipherable codes (Corresp.)
• On unique, multiset, and set decipherability of three-word codes
• Three-element codes with one \(d\)-primitive word
• On numerically decipherable codes and their homophonic partitions

This page was built for publication: Note on decipherability of three-word codes

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