Abstract
Using maximal arcs in PG(3, 2m), we give a new proof of the fact that the binary cyclic code C(m)1, 22h−2h+1, the code of length 2m−1 with defining zeroes α and αt, t=22h−2h+1, where α is a primitive element in GF(2m), is 2-error-correcting when gcd(m, h)=1.
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.
