Deciding multiset decipherability
Tom Head, Andreas Weber⋆ · IEEE Transactions on Information Theory · 1995
An O(n/sup 2/L) 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.>