The new minimum distance bounds of Goppa codes and their decoding (Q679428)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The new minimum distance bounds of Goppa codes and their decoding |
scientific article; zbMATH DE number 1002524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The new minimum distance bounds of Goppa codes and their decoding |
scientific article; zbMATH DE number 1002524 |
Statements
The new minimum distance bounds of Goppa codes and their decoding (English)
0 references
26 June 1997
0 references
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.
0 references
Goppa codes
0 references
subfield-subcode
0 references
minimum distance
0 references
BCH bound
0 references
Hartmann-Tzeng bound
0 references
lower bounds
0 references
decoding
0 references
0.9616592
0 references
0 references
0 references
0 references
0.9160351
0 references
0.91335225
0 references
0.9088726
0 references
0.9049771
0 references
