B. Wagle
EJOR
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.
B. Wagle
EJOR
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Pradip Bose
VTS 1998