Conference paper
Discourse segmentation in aid of document summarization
B.K. Boguraev, Mary S. Neff
HICSS 2000
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
B.K. Boguraev, Mary S. Neff
HICSS 2000
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Thomas M. Cover
IEEE Trans. Inf. Theory
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001