Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
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
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
Qing Li, Zhigang Deng, et al.
IEEE T-MI