A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
From MaRDI portal
Recommendations
- New codes for the Berlekamp-Massey-Sakata algorithm
- Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
- scientific article; zbMATH DE number 493099
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
- scientific article; zbMATH DE number 493096
- Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials
- Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
- ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS
- Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
Cited in
(7)- The key equation for one-point codes and efficient error evaluation
- New serial architecture for the Berlekamp-Massey algorithm
- Systolic Array Architecture Implementing Berlekamp–Massey–Sakata Algorithm for Decoding Codes on a Class of Algebraic Curves
- scientific article; zbMATH DE number 1057763 (Why is no real title available?)
- Parallel implementation of the Schur Berlekamp-Massey algorithm on a linearly connected processor array
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- List decoding of Hermitian codes using Gröbner bases
This page was built for publication: A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701109)