Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
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
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Daniel M. Bikel, Vittorio Castelli
ACL 2008
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
B. Wagle
EJOR