Convolutional codes over finite abelian groups: Some basic results
Abelian groups provide the most natural structure to represent codes over phase modulation signals. Convolutional codes over finite abelian groups are introduced, and the properties of linear encoders for this class of codes are analyzed. Through the structure theorem for finitely generated abelian groups, this analysis can be reduced to the study of convolutional codes over the ring \(\mathbb{Z}_n\). The concept of encoding group is introduced and compared with the more classical input group introduced by Forney and Trott. In the last part of the paper the state space realization of a convolutional code and of a convolutional encoder is investigated. For the entire collection see [Zbl 0960.00082].
- Canonical kernel representations for behaviors over finite Abelian groups
- Minimal and systematic convolutional codes over finite Abelian groups
- Homomorphic encoders of profinite abelian groups. I
- Convolutional block codes with cryptographic properties over the semi-direct product \(\mathbb {Z}/N \mathbb {Z} \rtimes \mathbb {Z}/M \mathbb {Z}\)
- Convolutional codes over groups
- Dynamical systems and convolutional codes over finite Abelian groups
- A generalized DFT for Abelian codes over Z/sub m/
- Orbit codes of finite abelian groups and lattices
- On-orbit codes of posets and operators in algebra
- On order ideals in orbit codes of finite abelian groups: results and impacts
- Convolutional codes from group rings
- Non-commutative convolutional codes over the infinite dihedral group
This page was built for publication: Convolutional codes over finite abelian groups: Some basic results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776534)
