On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
From MaRDI portal
Publication:517269
DOI10.1007/s10623-016-0204-9zbMath1379.94060arXiv1601.04507OpenAlexW2963992627MaRDI QIDQ517269
Marisa Toste, Raquel Pinto, D. Napp Avelli
Publication date: 23 March 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.04507
Related Items
On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\) ⋮ The Dual of Convolutional Codes Over $${\mathbb {Z}}_{p^r}$$ ⋮ Convolutional codes over finite chain rings, MDP codes and their characterization ⋮ MDS 2D convolutional codes with optimal 1D horizontal projections ⋮ Concatenation of convolutional codes and rank metric codes for multi-shot network coding ⋮ Feedback equivalence of convolutional codes over finite rings ⋮ Asymptotically good convolutional codes ⋮ A new rank metric for convolutional codes ⋮ A matrix based list decoding algorithm for linear codes over integer residue rings ⋮ Noncatastrophic convolutional codes over a finite ring
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing strongly-MDS convolutional codes with maximum distance profile
- Input-state-output representations and constructions of finite support 2D convolutional codes
- MDS and self-dual codes over rings
- The predictable degree property and row reducedness for systems over a finite ring
- Canonical kernel representations for behaviors over finite Abelian groups
- On minimal realization over a finite chain ring
- Maximum distance separable convolutional codes
- On the key equation over a commutative ring
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- Modular and \(p\)-adic cyclic codes
- On the construction of trellis codes based on (P)UM codes over \(\mathbb Z_4\)
- A new class of superregular matrices and MDP convolutional codes
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- On behaviors and convolutional codes
- 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
- Some structural properties of convolutional codes over rings
- On the Hamming distance of linear codes over a finite chain ring
- Constructions of MDS-convolutional codes
- 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
- On Classical and Quantum MDS-Convolutional BCH Codes
- MDS Convolutional Codes Over a Finite Ring
- Algorithmic Solution of the Change-Making Problem
This page was built for publication: On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
