Daniel M. Bikel, Vittorio Castelli
ACL 2008
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.
Daniel M. Bikel, Vittorio Castelli
ACL 2008
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Reena Elangovan, Shubham Jain, et al.
ACM TODAES