Strongly-MDS convolutional codes

Authors:
H. Gluesing-Luerssen;J. Rosenthal;R. Smarandache
Affiliations:
Dept. of Math., Univ. of Groningen, Netherlands;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

On Elliptic Convolutional Goppa Codes

AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Decoding of MDP convolutional codes over the erasure channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
A study on new right/left inverses of nonsquare polynomial matrices

International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications

Quantified Score

Hi-index	754.84

Visualization

Abstract

Maximum-distance separable (MDS) convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper, a class of MDS convolutional codes is introduced whose column distances reach the generalized Singleton bound at the earliest possible instant. Such codes are called strongly-MDS convolutional codes. They also have a maximum or near-maximum distance profile. The extended row distances of these codes will also be discussed briefly.