Strongly MDS Convolutional Codes
Heide Gluesing-Luerssen, Joachim Rosenthal, Roxana Smarandache
Abstract
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 we introduce a class of MDS convolutional codes whose column distances reach the generalized Singleton bound at the earliest possible instant. We call these codes strongly MDS convolutional codes. It is shown that these codes can decode a maximum number of errors per time interval when compared with other convolutional codes of the same rate and degree. These codes have also a maximum or near maximum distance profile. A code has a maximum distance profile if and only if the dual code has this property.
Create a lesson
Related papers
The operad of anti-pre-Lie algebras and its Lie elements
Chengming Bai, Vladimir Dotsenko, Guilai Liu et al.
Lie Algebras of Locally Finite Derivations over Fields of Positive Characteristic
Oksana Bezushchak, Anatoliy Petravchuk
A noetherian Hopf algebra has bijective antipode
Andrea Sciandra
Bimodule duality and Artin's problem for skew field extensions
Niels Lauritzen, Jesper Funch Thomsen
Cohen-Macaulay truncated path and Nakayama algebras
Takahiro Honma, Satoshi Usui
Rota-Baxter operators and factorization of Lie affgebras
JiaJia Han, Abror Khudoyberdiyev, Yunzhou Xie et al.