A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II
From MaRDI portal
Recommendations
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I
- Simplified understanding and efficient decoding of a class of algebraic-geometric codes
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
- On the decoding of algebraic-geometric codes
Cites work
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I
- Decoding algebraic-geometric codes up to the designed minimum distance
- Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring
- Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
- scientific article; zbMATH DE number 47606 (Why is no real title available?)
- Majority coset decoding
- On the decoding of algebraic-geometric codes
- Simplified understanding and efficient decoding of a class of algebraic-geometric codes
Cited in
(3)
This page was built for publication: A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283084)