Yao Qi, Raja Das, et al.
ISSTA 2009
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. © 1982. IEEE. All rights reserved.
Yao Qi, Raja Das, et al.
ISSTA 2009
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
M.F. Cowlishaw
IBM Systems Journal