Answers are grounded in this paper and cite their sources.
In this paper, a class of p-ary 3-weight linear codes and a class of binary 2-weight linear codes are proposed respectively by virtue of the properties of the perfect nonlinear functions over Fp(m)and (m, s)-bent functions from F2(m)to F2(s), where p is an odd prime and m, s are positive integers. The weight distributions are completely determined by the sign of the Walsh transform of weakly regular bent functions and the size of the preimage of the employed (m, s)-bent functions at the zero point, respectively. As a special case, a class of optimal linear codes meeting Griesmer bound is obtained from our construction.
No takes yet. Share an insight, caveat, or question.
Wu et al. (2019) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: