Abstract
Linear codes with a few weights have nice applications in communication, secret sharing schemes, authentication codes, association schemes, block designs and so on. Projective binary linear codes are one of the most important subclasses of linear codes for practical applications. The objective of this paper is to construct projective binary linear codes with some special Boolean functions. Four families of binary linear codes with three or four weights are derived and the parameters of their duals are also determined. It turns out that the duals of these codes are optimal or almost optimal with respect to the sphere-packing bound. As applications, the codes presented in this paper can be used to construct association schemes and secret sharing schemes with interesting access structures.
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 callMore From: Applicable Algebra in Engineering, Communication and Computing
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.
