Peterson-Gorenstein-Zierler algorithm for skew RS codes
From MaRDI portal
Publication:5206286
Abstract: We design a non-commutative version of the Peterson-Gorenstein-Zierler decoding algorithm for a class of codes that we call skew RS codes. These codes are left ideals of a quotient of a skew polynomial ring, which endow them of a sort of non-commutative cyclic structure. Since we work over an arbitrary field, our techniques may be applied both to linear block codes and convolutional codes. In particular, our decoding algorithm applies for block codes beyond the classical cyclic case.
Recommendations
Cites work
- A Class of Error-Correcting Codes in p^m Symbols
- A method for solving key equation for decoding goppa codes
- A New Perspective of Cyclicity in Convolutional Codes
- Coding with skew polynomial rings
- Convolutional codes I: Algebraic structure
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3887879 (Why is no real title available?)
- scientific article; zbMATH DE number 3147923 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- On a class of alternating cyclic convolutional codes
- On a class of error correcting binary group codes
- On cyclic convolutional codes
- On the structure of convolutional and cyclic convolutional codes
- Pseudo linear transformations and evaluation in Ore extensions
- Skew-cyclic codes
- Structure and constructions of cyclic convolutional codes
- Theory of non-commutative polynomials
- Vandermonde and Wronskian matrices over division rings
Cited in
(8)- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Roos bound for skew cyclic codes in Hamming and rank metric
- Peterson-Gorenstein-Zierler algorithm for differential convolutional codes
- An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric
- Primitive idempotents in central simple algebras over \(\mathbb{F}_q(t)\) with an application to coding theory
- Dual skew codes from annihilators: transpose Hamming ring extensions
- Decoding up to Hartmann-Tzeng and Roos bounds for rank codes
- Linear complementary pairs of skew constacyclic codes
This page was built for publication: Peterson-Gorenstein-Zierler algorithm for skew RS codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206286)