Abstract
In this paper, for an odd prime p, several classes of two-weight linear codes over the finite field Fp are constructed from the defining sets, and then their complete weight enumerators are determined by employing character sums. These codes can be suitable for applications in secret sharing schemes. Furthermore, two new classes of projective two-weight codes are obtained, and then two new classes of strongly regular graphs are given.
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.
