Abstract
A binary linear code in with dimension k and minimum distance d is called an [n, k, d] code. For each positive integer m, the first order Reed-Muller code R(1, m) is a linear code [2 m , m+1, 2 m–1]. When m=3, an extremal doubly-even self-dual code of length 23=8 exists. In this paper, it is shown that the first order Reed-Muller code R(1, m) holds a 3-(2 m , 2 m–1, 2 m–2–1) design for m≥3. It is also shown that Steiner system holds for m=3.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Discrete Mathematical Sciences and Cryptography
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.