Abstract
This work treats a way to obtain the parity check codes through geometric Goppa codes. Two cases have been considered depending on the taken field characteristic as alphabet and on the code length. It has been used the technique of linear code restriction. More precisely, it has been showed that the parity check codes are obtained as the restriction of a rational geometric Goppa code.
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.
