William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Paper
A Fast Test for Unique Decipherability Based on Suffix Trees
Abstract
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.
Related
Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009