Deciding multiset decipherability

DOI10.1109/18.370097zbMath0823.94020OpenAlexW2129384797MaRDI QIDQ4840896

Andreas Weber, Tom Head

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)

Related Items (7)

Factorization in Formal Languages ⋮ On numerically decipherable codes and their homophonic partitions ⋮ The finest homophonic partition and related code concepts ⋮ Relational codes of words ⋮ Codes, orderings, and partial words ⋮ Multiset and set decipherable codes ⋮ FULL MONOIDS AND MAXIMAL CODES

This page was built for publication: Deciding multiset decipherability