On numerically decipherable codes and their homophonic partitions
Information Processing Letters
Codes, orderings, and partial words
Theoretical Computer Science
Theoretical Computer Science
Varieties of codes and kraft inequality
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 754.84 |
An O(n2L) time and O((n+k)L) space algorithm is provided for deciding whether or not a finite set C consisting of n words having total length L, where all words are taken over a k-element alphabet, is a multiset decipherable code. The algorithm is based on a technique related to dominoes. At an easily stage it decides in O(nL) time and O((n+k)L) space whether or not the set C is uniquely decipherable