Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
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
Rolf Clauberg
IBM J. Res. Dev
Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Yao Qi, Raja Das, et al.
ISSTA 2009