A matrix based list decoding algorithm for linear codes over integer residue rings
From MaRDI portal
Publication:2229499
DOI10.1016/j.laa.2020.09.031zbMath1475.94196OpenAlexW3088440131MaRDI QIDQ2229499
Raquel Pinto, Elif Saçıkara, Marisa Toste, D. Napp Avelli
Publication date: 17 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/113405
finite ringserasure channelmatrix representationsdecoding algorithmsparity-check matrixlinear codes over finite rings
Finite rings and finite-dimensional associative algebras (16P10) Linear codes (general theory) (94B05) Decoding (94B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of von Neumann rings in terms of linear systems
- Codes over a family of local Frobenius rings, Gray maps and self-dual codes
- On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
- An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
- Alternant and BCH codes over certain rings
- On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\)
- Modular and \(p\)-adic cyclic codes
- List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings
- Algebraic soft-decision decoding of reed-solomon codes
- Reed–Solomon List Decoding From a System-Theoretic Perspective
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- On the decoding of Reed-Solomon and BCH codes over integer residue rings
- Behavioral Models for List Decoding
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- On the Hamming distance of linear codes over a finite chain ring
- The Dual of Convolutional Codes Over $${\mathbb {Z}}_{p^r}$$
- On Minimality of Convolutional Ring Encoders
- MDS Convolutional Codes Over a Finite Ring
This page was built for publication: A matrix based list decoding algorithm for linear codes over integer residue rings
