Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
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
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Limin Hu
IEEE/ACM Transactions on Networking
Qing Li, Zhigang Deng, et al.
IEEE T-MI