Strongly MDS Convolutional Codes

Simple item page
dc.creatorGluesing-Luerssen, Heide
dc.creatorRosenthal, Joachim
dc.creatorSmarandache, Roxana
dc.date2003-03-20
dc.date.accessioned2026-07-07T08:18:13Z
dc.date.available2026-07-07T08:18:13Z
dc.descriptionMDS 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.
dc.description33 pages
dc.identifierhttps://arxiv.org/abs/math/0303254
dc.identifierhttp://arxiv.org/abs/math/0303254
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134354
dc.subjectRings and Algebras
dc.subjectInformation Theory
dc.subjectOptimization and Control
dc.subject94B10 (Primary) 94B65, 11T71 (Secondary)
dc.titleStrongly MDS Convolutional Codes
dc.typetext

Files

Collections

arXiv