Construction of Algebraic Convolutional Codes Based on Reed-Solomon Generator Polynomials

In this paper we investigate a convolutional code construction method based on Reed-Solomon generator polynomials for different code rates. We show that such codes have different free distance values, among which there are good values for a given constraint length. We also provide a table with free distance values for constructed codes in a small finite field.