2003/03/20 by Heide Gluesing-Luerssen, Gluesing-Luerssen, Heide, Joachim Rosenthal +3 · 1 citation
Computer Science · Engineering · Mathematics · #11T71 (Secondary) #94B10 (Primary) 94B65 #Advanced Wireless Communication Techniques #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Optimization and Control (math.OC) #Rings and Algebras (math.RA) #cs.IT #math.IT #math.OC #math.RA #msc:11T71 #msc:94B10 #msc:94B65
paper · pdf · doi:10.48550/arxiv.math/0303254
33 pages
arxiv created 2003/03/20 · openalex publication_date 2003/03/20 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.