On the construction of comma-free codes

DOI10.1109/TIT.1965.1053766MaRDI QIDQ5512653zbMATH OpenFDO

Authors Willard L. Eastman

Publication date 1965

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1965.1053766

zbMATH Keywords

comma-free codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Cited in

(15)

• Restrictions and generalizations on comma-free codes
• Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences
• Retrograde codes and bounded synchronization delay
• Strand design for biomolecular computation.
• The alphabetic complexity in homomorphic definitions of word, tree and picture languages
• Graded alphabets, circular codes, free Lie algebras and comma-free codes
• Hall sets, Lazard sets and comma-free codes
• Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
• Maximal dinucleotide comma-free codes
• scientific article; zbMATH DE number 3891253 (Why is no real title available?)
• The comma-free codes with words of length two
• Finite Completion of comma-free codes Part 1
• scientific article; zbMATH DE number 7731171 (Why is no real title available?)
• Computer-aided constructions of commafree codes
• Homomorphic definitions of tree languages via comma-free tree codes

This page was built for publication: On the construction of comma-free codes

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