Goppa码一致校验位数目的下限

Lower Bound on Number of Parity Check Digits for Goppa Codes

给定一个Ｇｏｐｐａ码，如何求出它的一致校验位数目问题，至今尚未解决。估计一致校验位数目，一般只用上限来估计．本文提出了不仅可用上限也可用下限来估计一致校验位数目的观点，并且给出了估计方法。用这种方法，某些特殊的Ｇｏｐｐａ码是能够求出它的一致校验位数目的。

The problem of finding the number of parity check digits for a given Goppa code has not been solved yet. Unlike general methods, a lower bound is given to estimate the number of parity check digits, and a method of computing the lower bound is also given, the number of parity check digits can be given by the upper bound and the lower bound of it,