Feng Gui-liang. Generalization of Lower Bound on the Minimum Distanceand the Upper Bound on the Number of Parity CheckDigits for Goppa Codes[J]. Acta Electronica Sinica, 1983, (2): 66-72.
Feng Gui-liang. Generalization of Lower Bound on the Minimum Distanceand the Upper Bound on the Number of Parity CheckDigits for Goppa Codes[J]. Acta Electronica Sinica, 1983, (2): 66-72.DOI:
Generalization of Lower Bound on the Minimum Distanceand the Upper Bound on the Number of Parity CheckDigits for Goppa Codes
The problem of finding the minimum distance and the number of parity check digits for a given Goppa code has not been solved as yet. It is well known that the Goppa code over GF(q) with G(z) and L GF (qm) has its minimum distance d≥deg G(z) + 1 and its number of parity check digits n-k≤m deg G(z)
and in the binary case
let G(z) be the lowest degree perfect square which is divisible by G(z)
then d≥-deg G(z) +1. In this paper
these results are generalized
and it is pointed out that the minimum distance and the number of parity check digits for a given Goppa code are related not only with G(z) but also with L.