Abstract

This article presents the construction of binary linear Hadamard codes with parameters (2n,4n,n) over the fields F4 and F8. We generalize this construction to the field $F_{2^{k}}$ to generate Hadamard codes with parameters $\left (2^{k-1}n, 2^{k}n, 2^{k-2}n\right )$ for $k\in \mathbb {N}$ . We construct s-PD sets of size s + 1, a special subset of the permutation automorphism group of a code, which enables the correction of s errors for Hadamard codes over the field F4. We also discuss the decoding algorithm for these Hadamard codes.

Full Text
Paper version not known

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 call

Disclaimer: 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.