A construction technique for random-error-correcting convolutional codes
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown how the above algorithm can be modified slightly to produce codes with known free distance, and a comparison of probability of error with sequential decoding is made among the best known constructive codes of constraint length.
Abstract
A simple algorithm is presented for finding rate 1/n random-error-correcting convolutional codes. Good codes considerably longer than any now known are obtained. A discussion of a new distance measure for convolutional codes, called the free distance, is included. Free distance is particularly useful when considering decoding schemes, such as sequential decoding, which are not restricted to a fixed constraint length. It is shown how the above algorithm can be modified slightly to produce codes with known free distance. A comparison of probability of error with sequential decoding is made among the best known constructive codes of constraint length 36.