Achieving the designed error capacity in decoding algebraic-geometric codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1775409
- Decoding algebraic-geometric codes up to the designed minimum distance
- scientific article; zbMATH DE number 493096
- On the decoding of algebraic-geometric codes
- On the decoding of algebraic-geometric codes
- On the decoding of algebraic-geometric codes
- scientific article; zbMATH DE number 5568409
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
- scientific article; zbMATH DE number 107496
- Simplified understanding and efficient decoding of a class of algebraic-geometric codes
Cited in
(12)- The key equation for one-point codes and efficient error evaluation
- Elliptic codes over fields of characteristic 2
- Determining when the absolute state complexity of a Hermitian code achieves its DLP bound
- Algebraic decoding using special divisors
- Algebraic geometric codes on surfaces
- scientific article; zbMATH DE number 1461541 (Why is no real title available?)
- The theta divisor of a Jacobian variety and the decoding of geometric Goppa codes
- Decoding beyond the designed distance for certain algebraic codes
- scientific article; zbMATH DE number 1775409 (Why is no real title available?)
- Algebraic-geometry codes and decoding by error-correcting pairs
- On the decoding of algebraic-geometric codes over F/sub q/ for q<or=16
- Decoding algebraic geometry codes by a key equation
This page was built for publication: Achieving the designed error capacity in decoding algebraic-geometric codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277134)