2016/01/18 by Diego Napp, Napp, Diego, Raquel Pinto +3
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Rings and Algebras (math.RA) #cs.IT #graph theory and CDMA systems #math.IT #math.RA
paper · pdf · doi:10.48550/arxiv.1601.04507
arxiv created 2016/01/18 · openalex publication_date 2016/01/18 · arxiv updated 2016/01/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Maximum Distance Separable (MDS) convolutional codes are cha- racterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over Z p r was recently discovered in [26] via the Hensel lift of a cyclic code. In this paper we further investigate this important class of convolutional codes over Z p r from a new perspective. We introduce the notions of p-standard form and r- optimal parameters to derive a novel upper bound of Singleton type on the free distance. Moreover, we present a constructive method for building general (non necessarily free) MDS convolutional codes over Z p r for any given set of parameters.