The new minimum distance bounds of Goppa codes and their decoding

MaRDI QIDQ679428zbMATH OpenFDO

Authors Juan-Miguel Gracia

Publication date 26 June 1997

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

lower boundsminimum distanceGoppa codesBCH bounddecodingHartmann-Tzeng boundsubfield-subcode

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Decoding (94B35)

Recommendations

• Bounds on the Minimum Distance of Goppa Codes
• New bounds on the distance distribution of extended Goppa codes
• A new approach to the minimum distance of Goppa geometry codes
• Improving the minimum distance bound of trace Goppa codes
• A generalized floor bound for the minimum distance of geometric Goppa codes
• Weierstrass pairs and minimum distance of Goppa codes
• Decoding Cyclic Codes up to a New Bound on the Minimum Distance
• scientific article; zbMATH DE number 1189044
• Chain of Separable Binary Goppa Codes and Their Minimal Distance
• scientific article; zbMATH DE number 4104869

Cited in

(9)

• A generalized floor bound for the minimum distance of geometric Goppa codes
• Improving the minimum distance bound of trace Goppa codes
• A new approach to the minimum distance of Goppa geometry codes
• Weierstrass pairs and minimum distance of Goppa codes
• New binary codes from extended Goppa codes
• Bounds on the Minimum Distance of Goppa Codes
• A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
• A (55,16,19) binary Goppa code and related codes having large minimum distance
• New bounds on the distance distribution of extended Goppa codes

This page was built for publication: The new minimum distance bounds of Goppa codes and their decoding

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