Minimal Trellis Construction for Finite Support Convolutional Ring Codes
From MaRDI portal
Publication:3540925
DOI10.1007/978-3-540-87448-5_11zbMath1166.94353arXiv0801.3703OpenAlexW1880607121MaRDI QIDQ3540925
Raquel Pinto, Margreta Kuijper
Publication date: 25 November 2008
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.3703
Related Items (4)
State representations of convolutional codes over a finite ring ⋮ Minimal Gröbner bases and the predictable leading monomial property ⋮ On MDS convolutional codes over \(\mathbb{Z}_{p^r}\) ⋮ Noncatastrophic convolutional codes over a finite ring
Cites Work
- Unnamed Item
- Computation of the weight distribution of CRC codes
- State space realizations and monomial equivalence for convolutional codes
- The predictable degree property and row reducedness for systems over a finite ring
- Maximum distance separable convolutional codes
- Minimality and observability of group systems
- Matrix fraction descriptions in convolutional coding
- Modular and \(p\)-adic cyclic codes
- Convolutional codes over groups
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- On behaviors and convolutional codes
- Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings
- The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Cyclic codes and quadratic residue codes over Z/sub 4/
- On Minimality of Convolutional Ring Encoders
This page was built for publication: Minimal Trellis Construction for Finite Support Convolutional Ring Codes