Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Paper
Some Convolutional Codes Whose Free Distances are Maximal
Abstract
The free distance of a convolutional code of rate 1/n is bounded by n times the constraint length of its encoder. Two classes of convolutional codes whose free distances meet this bound are studied. A technique of constructing convolutional codes that meet this bound for all sufficiently large n is also given. © 1989 IEEE
Related
Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010