Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring

DOI10.1109/18.476242MaRDI QIDQ4880294zbMATH OpenOpenAlexFDO

Authors Ba-Zhong Shen, Kenneth K. Tzeng

Publication date 11 June 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.476242

zbMATH Keywords

algebraic-geometric codesgeometric Goppa codesdesigned minimum distancemajority voting scheme

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• Decoding geometric Goppa codes using an extra place
• Decoding algebraic geometry codes by a key equation
• scientific article; zbMATH DE number 125897

Cited in

(4)

• The key equation for one-point codes and efficient error evaluation
• A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II
• scientific article; zbMATH DE number 125897 (Why is no real title available?)
• Decoding geometric Goppa codes using an extra place

This page was built for publication: Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880294)