Right complete codes

DOI10.1007/S002330010105MaRDI QIDQ1601814zbMATH OpenOpenAlexFDO

Authors M. Satyanarayana

Publication date 27 June 2002

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002330010105

zbMATH Keywords

prefix codesright complete codessemaphore codes

Mathematics Subject Classification ID

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

Review text

The structure and properties of right complete codes are studied. In particular, a new characterization of semaphore codes is given, and it is proved that some classes of right complete codes are nonrecognizable. The theory is illustrated with many examples as well as with a few open problems.

Recommendations

• scientific article; zbMATH DE number 6665189
• On a problem of satyanarayana regarding the recognizability of codes
• Limited semaphore codes
• On codes having no finite completion
• Completely simple codes

Cited in

(2)

• On a problem of satyanarayana regarding the recognizability of codes
• Completing codes

This page was built for publication: Right complete codes

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