A necessary and sufficient criterion is provided for Goppa codes to attain minimum distance equal to their designed distance, leading to exact distances for multiple infinite families of such codes and BCH codes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Minimum Distances of Some Families of Goppa Codes and BCH Codes
A necessary and sufficient criterion is provided for Goppa codes to attain minimum distance equal to their designed distance, leading to exact distances for multiple infinite families of such codes and BCH codes.