Abstract
This article presents the recursive construction of s-PD sets, a special subset of the permutation automorphism group of a code, which enables the correction of s errors of binary linear Hadamard codes over the field F4. We discuss the rank and kernel of these Hadamard codes. We develop new MAGMA functions to generate Hadamard codes over the field F4. We also give MAGMA functions to find the minimum distance and generator matrix of a Hadamard code over F4.
Sign-in/Register to access full text options 
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.
