Author:
,KUMAR PAVAN,KHAN NOOR MOHAMMAD,
Abstract
Recently, linear codes constructed from defining sets have been studied extensively. For an odd prime p, let Trm e be the trace function from Fpm onto Fpe, where e is a divisor of m. In this paper, for the defining set D = {x ∈ F∗ pm : Trm e (x2 + x) = 0} = {d1,d2,...,dn} (say), we define a pe-ary linear code CD by CD ={cx =Trm e (xd1),Trm e (xd2),...,Trm e (xdn) : x ∈ Fpm} and present three-weight and five-weight linear codes with their weight distributions. We show that each nonzero codeword of CD is minimal for m e ≥ 5 and, thus, such codes are applicable in secret sharing schemes.
Publisher
University Library in Kragujevac