Zohar Feldman, Avishai Mandelbaum
WSC 2010
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
Zohar Feldman, Avishai Mandelbaum
WSC 2010
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007