A fast test for unique decipherability based on suffix trees (Corresp.)
Michael Rodeh · IEEE Transactions on Information Theory · 1982
The classical algorithm for testing unique decipherability of codes is improved by using McCreight's algorithm for constructing suffix trees. The complexity of the algorithm is O(nm) where n is the number of codewords and m is their total length. Efficiency is gained by avoiding repeatedly comparing subwords of the codewords.