A code decomposition approach for decoding cyclic and algebraic-geometric codes
From MaRDI portal
Recommendations
Cited in
(14)- Decoding up to 4 errors in hyperbolic-like abelian codes by the Sakata algorithm
- On cyclic algebraic-geometry codes
- On the syndrome arrays of a class of algebraic-geometric codes
- scientific article; zbMATH DE number 417878 (Why is no real title available?)
- scientific article; zbMATH DE number 3965972 (Why is no real title available?)
- scientific article; zbMATH DE number 1284432 (Why is no real title available?)
- scientific article; zbMATH DE number 493099 (Why is no real title available?)
- The n-dimensional key equation and a decoding application
- Algebraic decoding of class of multilevel pseudocyclic codes
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
- A generalized Forney formula for algebraic-geometric codes
- On the existence of order functions
- Improved decoding of affine-variety codes
- A symmetric Roos bound for linear codes
This page was built for publication: A code decomposition approach for decoding cyclic and algebraic-geometric codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880317)