Abstract
Recently, linear codes constructed from defining sets have been studied extensively. They may have excellent parameters if the defining set is chosen properly. Let m>2 be a positive integer. For an odd prime p, let r=pm and Tr be the absolute trace function from Fr onto Fp. In this paper, we give a construction of linear codes by defining the codeCD={(Tr(ax))x∈D:a∈Fr}, where D={x∈Fr:Tr(x)=1,Tr(x2)=0}. Its complete weight enumerator and weight enumerator are determined explicitly by employing cyclotomic numbers and Gauss sums. However, we find that the code is optimal with respect to the Griesmer bound provided that m=3. In fact, it is MDS when m=3. Moreover, the codes presented have higher rate compared with other codes, which enables them to have essential applications in areas such as association schemes and secret sharing schemes.
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.
