Deciding multiset decipherability

DOI10.1109/18.370097MaRDI QIDQ4840896zbMATH OpenOpenAlexFDO

Authors Tom Head, Andreas Weber

Publication date 18 October 1995

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

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

zbMATH Keywords

algorithmdecipherabilitymultiset decipherable code

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decoding (94B35)

Recommendations

• The finest homophonic partition and related code concepts
• scientific article; zbMATH DE number 3883641
• A fast algorithm for the unique decipherability of multivalued encodings
• Decidability of multiset, set and numerically decipherable directed figure codes
• Multiset and set decipherable codes

Cited in

(10)

• Decipherability of codes
• On numerically decipherable codes and their homophonic partitions
• Relational codes of words
• Full monoids and maximal codes
• scientific article; zbMATH DE number 3883641 (Why is no real title available?)
• Factorization in formal languages
• The finest homophonic partition and related code concepts
• The finest homophonic partition and related code concepts
• Multiset and set decipherable codes
• Codes, orderings, and partial words

This page was built for publication: Deciding multiset decipherability

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