About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 1987
Conference paper
Some convolutional codes whose free distances are maximal
Abstract
Summary form only given, as follows. The free distance of a convolutional code of rate 1/n is bounded by the constraint length of its encoder times n. Two classes of convolutional codes whose free distances meet this bound with equality will be presented. A technique to construct convolutional codes which meet this bound with equality for all sufficiently large are also given.