An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
From MaRDI portal
Publication:3129471
DOI10.1109/18.556679zbMath0874.94038OpenAlexW2065681224MaRDI QIDQ3129471
No author found.
Publication date: 27 April 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b680b84e174ce12ce7ea4d82569c1855d0b19ff5
Linear codes (general theory) (94B05) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Related Items (13)
On the ℤq-Simplex codes and its weight distribution for dimension 2 ⋮ The Dual of Convolutional Codes Over $${\mathbb {Z}}_{p^r}$$ ⋮ On ℤq-linear and ℤq-Simplex codes and its related parameters forqis a prime power ⋮ Minimal Gröbner bases and the predictable leading monomial property ⋮ Minimal Trellis Construction for Finite Support Convolutional Ring Codes ⋮ On the covering radius of some modular 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 ⋮ The generalization of some trellis properties of linear codes to group codes ⋮ A note on characteristic generators of a free cyclic code and its dual ⋮ Hulls of cyclic codes over \(\mathbb{Z}_4\) ⋮ The predictable degree property and row reducedness for systems over a finite ring ⋮ On linear codes over \(\mathbb Z_2\)
This page was built for publication: An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
