The new minimum distance bounds of Goppa codes and their decoding
From MaRDI portal
The paper presents two new lower bounds for the minimum distance of Goppa codes. The proof is based on the construction of an extended field code for the original Goppa code. It is shown that the given construction preserves minimum distance. Furthermore, decoding procedures guaranteeing correct decoding up to the new bounds for the cases of error-only and of error-and-erasure decoding are given.
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
(10)- New binary codes from extended Goppa codes
- A generalized floor bound for the minimum distance of geometric Goppa codes
- scientific article; zbMATH DE number 4200142 (Why is no real title available?)
- A (55,16,19) binary Goppa code and related codes having large minimum distance
- A new approach to the minimum distance of Goppa geometry codes
- Bounds on the Minimum Distance of Goppa Codes
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
- Weierstrass pairs and minimum distance of Goppa codes
- Improving the minimum distance bound of trace Goppa codes
- 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)
