Title :
Deciding multiset decipherability
Author :
Head, Tom ; Weber, Andreas
Author_Institution :
Dept. of Math. Sci., State Univ. of New York, Binghamton, NY, USA
fDate :
1/1/1995 12:00:00 AM
Abstract :
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
Keywords :
codes; decision theory; graph theory; dominoes; finite set; k-element alphabet; multiset decipherability; multiset decipherable code; space algorithm; time algorithm; Costs; Entropy; Notice of Violation; Performance analysis; Search problems; System testing;
Journal_Title :
Information Theory, IEEE Transactions on
