Reena Elangovan, Shubham Jain, et al.
ACM TODAES
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
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Conference paper
Association control in mobile wireless networks
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine