Abstract
Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, two classes of five-weight or six-weight linear codes over Fp are constructed and their weight distributions are determined by means of exponential sums. In one case, there are some almost optimal codes with respect to the Griesmer bound, which are in fact optimal according to the online code tables.
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.
