The new minimum distance bounds of Goppa codes and their decoding

zbMATH Open0886.94019MaRDI QIDQ679428

Juan-Miguel Gracia

Publication date: 26 June 1997

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

zbMATH Keywords

decodinglower boundsGoppa codesminimum distanceBCH boundHartmann-Tzeng boundsubfield-subcode

Mathematics Subject Classification ID

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

Related Items (6)

Improving the minimum distance bound of trace Goppa codes ⋮ Weierstrass pairs and minimum distance of Goppa codes ⋮ New bounds on the distance distribution of extended Goppa codes ⋮ A generalized floor bound for the minimum distance of geometric Goppa codes ⋮ Bounds on the Minimum Distance of Goppa Codes ⋮ A (55,16,19) binary Goppa code and related codes having large minimum distance

Recommendations

• New bounds on the distance distribution of extended Goppa codes 👍 👎
• A generalized floor bound for the minimum distance of geometric Goppa codes 👍 👎
• Bounds on the Minimum Distance of Goppa Codes 👍 👎
• Chain of Separable Binary Goppa Codes and Their Minimal Distance 👍 👎
• Decoding Cyclic Codes up to a New Bound on the Minimum Distance 👍 👎
• Weierstrass pairs and minimum distance of Goppa codes 👍 👎
• Improving the minimum distance bound of trace Goppa codes 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)