Abstract
Binary Goppa codes are a large and powerful family of error-correcting codes. But how to find the true minimum distance of binary Goppa codes is not solved yet. In this paper a new lower bound for the minimum distance of binary Goppa codes is shown. This new lower bound improves the results in Y. Sugiyama (1976) and Feng Guiliang's (1983) papers. The method in this paper can be generalized to other Goppa codes easily.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have