A matrix ring description for cyclic convolutional codes
From MaRDI portal
Abstract: In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe the algebraic parameters of the codes in a more accessible way. We show that the existence of such codes with given algebraic parameters can be reduced to the solvability of a modified rook problem. It is our strong belief that the rook problem is always solvable, and we present solutions in particular cases.
Recommendations
Cited in
(10)- On cyclic convolutional codes
- Convolutional codes: techniques of construction
- Nonbinary quantum convolutional codes derived from negacyclic codes
- On negacyclic MDS-convolutional codes
- An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials.
- ON THE ALGEBRAIC PARAMETERS OF CONVOLUTIONAL CODES WITH CYCLIC STRUCTURE
- Nonbinary convolutional codes derived from group character codes
- Codes Over Matrix Rings for Space-Time Coded Modulations
- A class of new group character codes and convolutional codes
- On cyclotomic cosets and code constructions
This page was built for publication: A matrix ring description for cyclic convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q939247)