Ideal codes over separable ring extensions
From MaRDI portal
Abstract: This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all previously known as well as new non trivial examples. It is proved that ideal codes are direct summands as left ideals of the underlying non-commutative algebra, in analogy with cyclic block codes. This implies, in particular, that they are generated by an idempotent element. Hence, by using a suitable separability element, we design an efficient algorithm for computing one of such idempotents.
Cited in
(13)- MDS codes over finite principal ideal rings
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Cyclic distances of idempotent convolutional codes
- Convolutional codes with a matrix-algebra word-ambient
- Computing separability elements for the sentence-ambient algebra of split ideal codes
- Codes ideaux de certaines algebres modulaires et ramification
- The Extended Reed-Solomon Codes Considered as Ideals or a Modular Algebra
- Almost-disjoint coding and strongly saturated ideals
- Certain properties of square matrices over fields with applications to rings
- Dual skew codes from annihilators: transpose Hamming ring extensions
- Minimal encoders of convolutional codes with general cyclic structures
- Skew Laurent series and general cyclic convolutional codes
- The extended Golay codes considered as ideals
This page was built for publication: Ideal codes over separable ring extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347953)
