Abstract.
A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all linear block codes of rate k/n. It is well known that MDS block codes do exist if the field size is more than n. In this paper we generalize this concept to the class of convolutional codes of a fixed rate k/n and a fixed code degree δ. In order to achieve this result we will introduce a natural upper bound for the free distance generalizing the Singleton bound. The main result of the paper shows that this upper bound can be achieved in all cases if one allows sufficiently many field elements.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: December 10, 1998; revised version: May 14, 1999
Rights and permissions
About this article
Cite this article
Rosenthal, J., Smarandache, R. Maximum Distance Separable Convolutional Codes. AAECC 10, 15–32 (1999). https://doi.org/10.1007/s002000050120
Issue Date:
DOI: https://doi.org/10.1007/s002000050120