Aggregate error locator and error value computation in AG codes
DOI10.1016/J.JCTA.2006.03.016zbMATH Open1105.94020OpenAlexW2062184531MaRDI QIDQ855879FDOQ855879
Authors: P. Le Bars, Ph. Piret 
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.016
Recommendations
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic function fields and codes
- Title not available (Why is that?)
- Decoding algebraic-geometric codes up to the designed minimum distance
- Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
- On the Structure of Hermitian Codes and Decoding for Burst Errors
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decoding of codes defined by a single point on a curve
- A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound
This page was built for publication: Aggregate error locator and error value computation in AG codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855879)
