Abstract
Recently, the research of trace codes over finite fields has received a lot of attention because some of these codes have good parameters. In this paper, we construct several classes of trace codes from some special classes of linear codes and give their weight distributions, showing that they contain some optimal and almost optimal codes. Furthermore, we determine the parameters of the duals of the trace codes, and show that they are distance-optimal or nearly distance-optimal with respect to the sphere-packing bound.
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.
