Abstract
Linear codes with few weights have applications in secret sharing schemes, authentication codes, association schemes and strongly regular graphs. In this paper, we introduce a new flexible defining set, and consequently, we obtain several classes of t-weight linear codes over Fp, where t=4,5,6 and p is an odd prime. The parameters and weight distributions of the generated linear codes are fully determined using quadratic Gauss sums over finite fields. Moreover, two classes of optimal two-weight codes meeting the Griesmer bound are obtained from our constructions. Our results are heavily based on evaluating some exponential sums over finite fields. Computer experiments using MAGMA programs show that many (almost) optimal codes can be derived from our results.
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.
