On MDS convolutional codes over Z_p^r
From MaRDI portal
Publication:517269
DOI10.1007/S10623-016-0204-9zbMATH Open1379.94060arXiv1601.04507OpenAlexW2963992627MaRDI QIDQ517269FDOQ517269
Marisa Toste, Raquel Pinto, Diego Napp
Publication date: 23 March 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1601.04507
Recommendations
Cites Work
- Maximum distance separable convolutional codes
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- A new class of superregular matrices and MDP convolutional codes
- On behaviors and convolutional codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructions of MDS-convolutional codes
- On Classical and Quantum MDS-Convolutional BCH Codes
- Input-state-output representations and constructions of finite support 2D convolutional codes
- Constructing strongly-MDS convolutional codes with maximum distance profile
- Algorithmic Solution of the Change-Making Problem
- Modular and \(p\)-adic cyclic codes
- On the Hamming distance of linear codes over a finite chain ring
- MDS and self-dual codes over rings
- Some structural properties of convolutional codes over rings
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- Canonical kernel representations for behaviors over finite Abelian groups
- On minimal realization over a finite chain ring
- On the key equation over a commutative ring
- On the construction of trellis codes based on (P)UM codes over \(\mathbb Z_4\)
- Minimal Trellis Construction for Finite Support Convolutional Ring Codes
- Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings
- Construction of linear ring codes for 6 PSK
- System-theoretic properties of convolutional codes over rings
- Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound
- On Minimality of Convolutional Ring Encoders
- MDS Convolutional Codes Over a Finite Ring
- The predictable degree property and row reducedness for systems over a finite ring
Cited In (15)
- A new rank metric for convolutional codes
- A matrix based list decoding algorithm for linear codes over integer residue rings
- On the existence of non-catastrophic \(p\)-encoders of \((2, 1)\) convolutional codes over \(\mathbb{Z}_{p^2}\)
- The Dual of Convolutional Codes Over $${\mathbb {Z}}_{p^r}$$
- On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\)
- Asymptotically good convolutional codes
- MDS codes over finite principal ideal rings
- Convolutional block codes with cryptographic properties over the semi-direct product \(\mathbb {Z}/N \mathbb {Z} \rtimes \mathbb {Z}/M \mathbb {Z}\)
- Noncatastrophic convolutional codes over a finite ring
- Convolutional codes over finite chain rings, MDP codes and their characterization
- The Existence of Strongly MDS Convolutional Codes
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- MDS 2D convolutional codes with optimal 1D horizontal projections
- Feedback equivalence of convolutional codes over finite rings
- Constructions of MDS-convolutional codes
This page was built for publication: On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517269)
