Deciding multiset decipherability

DOI10.1109/18.370097zbMATH Open0823.94020OpenAlexW2129384797MaRDI QIDQ4840896FDOQ4840896

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

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

zbMATH Keywords

algorithmdecipherabilitymultiset decipherable code

Mathematics Subject Classification ID

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

Cited In (8)

• The finest homophonic partition and related code concepts
• Relational codes of words
• Full monoids and maximal codes
• Multiset and set decipherable codes
• Title not available (Why is that?)
• On numerically decipherable codes and their homophonic partitions
• Factorization in formal languages
• 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)