Abstract
Three classes of linear codes with good parameters are constructed in this paper. The length, dimension and minimum distance for each class of linear codes are also investigated by means of the well-known Kloosterman sums over finite fields. It is interesting to note that the constructed three classes of linear codes possess good parameters and some of them are shown to be optimal.
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.
