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
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
