AMC Home
On the security of the WOTS-PRF signature scheme
February 2019, 13(1): 195-211. doi: 10.3934/amc.2019013
Some two-weight and three-weight linear codes
Chengju Li 1,, , Sunghan Bae 2, and Shudi Yang 3,
Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai 200062, China
Department of Mathematics, KAIST, Daejeon, 305-701, Korea
School of Mathematical Sciences, Qufu Normal University, Shandong 273165, China
* Corresponding author: Chengju Li
Received August 2018 Published December 2018
Fund Project: Chengju Li was supported by the National Natural Science Foundation of China under Grant 11701179, the Shanghai Sailing Program under Grant 17YF1404300, and the Foundation of Science and Technology on Information Assurance Laboratory under Grant KJ-17-007.
Shudi Yang was supported by the National Natural Science Foundation of China under Grants 11701317 and 11431015, China Postdoctoral Science Foundation Funded Project under Grant 2017M611801, and Jiangsu Planned Projects for Postdoctoral Research Funds under Grant 1701104C.
Table(7)
$\Bbb F_q$
be the finite field with
$q = p^m$
elements, where
is an odd prime and
$m$
is a positive integer. For a positive integer
, let
$D \subset \Bbb F_q^t$
and let
$\mbox{Tr}_m$
be the trace function from
$\Bbb F_p$
. We define a
-ary linear code
$\mathcal C_D$
$ \mathcal C_D = \{\textbf{c}(a_1,a_2, ..., a_t): a_1, a_2, ..., a_t ∈ \Bbb F_{p^m}\}, $
$\textbf{c}(a_1,a_2, ..., a_t) = \big(\mbox{Tr}_m(a_1x_1+a_2x_2+···+a_tx_t)\big)_{(x_1,x_2, ..., x_t)∈ D}.$
In this paper, we will present the weight enumerators of the linear codes
in the following two cases:
$D = \{(x_1,x_2, ..., x_t) ∈ \Bbb F_q^t \setminus \{(0,0, ..., 0)\}: \mbox{Tr}_m(x_1^2+x_2^2+···+x_t^2) = 0\}$
$D = \{(x_1,x_2, ..., x_t) ∈ \Bbb F_q^t: \mbox{Tr}_m(x_1^2+x_2^2+···+x_t^2) = 1\}$
It is shown that
is a two-weight code if
$tm$
is even and three-weight code if
is odd in both cases. The weight enumerators of
in the first case generalize the results in [17] and [18]. The complete weight enumerators of
are also investigated.
Keywords: Linear codes, two-weight codes, three-weight codes, Gauss sums.
Mathematics Subject Classification: Primary: 94B05, 11T71; Secondary: 11T23.
Citation: Chengju Li, Sunghan Bae, Shudi Yang. Some two-weight and three-weight linear codes. Advances in Mathematics of Communications, 2019, 13 (1) : 195-211. doi: 10.3934/amc.2019013
L. D. Baumert and R. J. McEliece, Weights of irreducible cyclic codes, Inf. Control, 20 (1972), 158-175. doi: 10.1016/S0019-9958(72)90354-3. Google Scholar
[2] B. Berndt, R. Evans and K. Williams, Gauss and Jacobi Sums, John Wiley & Sons company, New York, 1998. Google Scholar
A. R. Calderbank and J. M. Goethals, Three-weight codes and association schemes, Philips J. Res., 39 (1984), 143-152. Google Scholar
A. R. Calderbank and W. M. Kantor, The geometry of two-weight codes, Bull. London Math. Soc., 18 (1986), 97-122. doi: 10.1112/blms/18.2.97. Google Scholar
C. Carlet, C. Ding and J. Yuan, Linear codes from perfect nonlinear mappings and their secret sharing schemes, IEEE Trans. Inf. Theory, 51 (2005), 2089-2102. doi: 10.1109/TIT.2005.847722. Google Scholar
C. Ding, Codes from Difference Sets, World Scientific, Singapore, 2015. Google Scholar
C. Ding, Linear codes from some 2-designs, IEEE Trans. Inf. Theory, 61 (2015), 3265-3275. doi: 10.1109/TIT.2015.2420118. Google Scholar
C. Ding, T. Helleseth, T. Klove and X. Wang, A general construction of authentication codes, IEEE Trans. Inf. Theory, 53 (2007), 2229-2235. doi: 10.1109/TIT.2007.896872. Google Scholar
C. Ding, C. Li, N. Li and Z. Zhou, Three-weight cyclic codes and their weight distributions, Discr. Math., 339 (2016), 415-427. doi: 10.1016/j.disc.2015.09.001. Google Scholar
C. Ding, Y. Liu, C. Ma and L. Zeng, The weight distributions of the duals of cyclic codes with two zeros, IEEE Trans. Inf. Theory, 57 (2011), 8000-8006. doi: 10.1109/TIT.2011.2165314. Google Scholar
C. Ding, J. Luo and H. Niederreiter, Two-weight codes punctured from irreducible cyclic codes, in Proceedings of the First Worshop on Coding and Cryptography (eds. Y. Li, et al. ), World Scientific, Singapore, 4 (2008), 119-124. doi: 10.1142/9789812832245_0009. Google Scholar
C. Ding and H. Niederreiter, Cyclotomic linear codes of order 3, IEEE Trans. Inf. Theory, 53 (2007), 2274-2277. doi: 10.1109/TIT.2007.896886. Google Scholar
C. Ding and X. Wang, A coding theory construction of new systematic authentication codes, Theor. Comp. Sci., 330 (2005), 81-99. doi: 10.1016/j.tcs.2004.09.011. Google Scholar
C. Ding and J. Yang, Hamming weights in irreducible cyclic codes, Discr. Math., 313 (2013), 434-446. doi: 10.1016/j.disc.2012.11.009. Google Scholar
C. Ding and J. Yin, Algebraic constructions of constant composition codes, IEEE Trans. Inf. Theory, 51 (2005), 1585-1589. doi: 10.1109/TIT.2005.844087. Google Scholar
K. Ding and C. Ding, Binary linear codes with three weights, IEEE Comm. Letters, 18 (2014), 1879-1882. Google Scholar
K. Ding and C. Ding, A class of two-weight and three-weight codes and their applications in secret sharing, IEEE Trans. Inf. Theory, 61 (2015), 5835-5842. doi: 10.1109/TIT.2015.2473861. Google Scholar
C. Li, Q. Yue and F. W. Fu, A construction of several classes of two-weight and three-weight linear codes, Appl. Alg. Eng. Comm. Comp., 28 (2017), 11-30. doi: 10.1007/s00200-016-0297-4. Google Scholar
S. Li, T. Feng and G. Ge, On the weight distribution of cyclic codes with Niho exponents, IEEE Trans. Inf. Theory, 60 (2014), 3903-3912. doi: 10.1109/TIT.2014.2318297. Google Scholar
[20] R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley Publishing Inc., 1983. Google Scholar
J. Luo and T. Helleseth, Constant composition codes as subcodes of cyclic codes, IEEE Trans. Inf. Theory, 57 (2011), 7482-7488. doi: 10.1109/TIT.2011.2161631. Google Scholar
C. Ma, L. Zeng, Y. Liu, D. Feng and C. Ding, The weight enumerator of a class of cyclic codes, IEEE Trans. Inf. Theory, 57 (2011), 397-402. doi: 10.1109/TIT.2010.2090272. Google Scholar
F. J. MacWilliams, C. L. Mallows and N. J. A. Sloane, Generalizations of Gleason's theorem on weight enumerators of self-dual codes, IEEE Trans. Inf. Theory, 18 (1972), 794-805. doi: 10.1109/tit.1972.1054898. Google Scholar
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977. Google Scholar
C. Tang, N. Li, Y. Qi, Z. Zhou and T. Helleseth, Linear codes with two or three weights from weakly regular bent functions, IEEE Trans. Inf. Theory, 62 (2016), 1166-1176. doi: 10.1109/TIT.2016.2518678. Google Scholar
G. Vega, The weight distribution of an extended class of reducible cyclic codes, IEEE Trans. Inf. Theory, 58 (2012), 4862-4869. doi: 10.1109/TIT.2012.2193376. Google Scholar
M. Xiong, The weight distributions of a class of cyclic codes, Finite Fields Appl., 18 (2012), 933-945. doi: 10.1016/j.ffa.2012.06.001. Google Scholar
J. Yang, M. Xiong, C. Ding and J. Luo, Weight distribution of a class of cyclic codes with arbitrary number of zeros, IEEE Trans. Inf. Theory, 59 (2013), 5985-5993. doi: 10.1109/TIT.2013.2266731. Google Scholar
S. Yang and Z. Yao, Complete weight enumerators of a class of linear codes, Discr. Math., 340 (2017), 729-739. doi: 10.1016/j.disc.2016.11.029. Google Scholar
S. Yang, X. Kong and C. Tang, A construction of linear codes and their complete weight enumerators, Finite Fields Appl., 48 (2017), 196-226. doi: 10.1016/j.ffa.2017.08.001. Google Scholar
J. Yuan and C. Ding, Secret sharing schemes from three classes of linear codes, IEEE Trans. Inf. Theory, 52 (2006), 206-212. doi: 10.1109/TIT.2005.860412. Google Scholar
X. Zeng, L. Hu, W. Jiang, Q. Yue and X. Cao, The weight distribution of a class of p-ary cyclic codes, Finite Fields Appl., 16 (2010), 56-73. doi: 10.1016/j.ffa.2009.12.001. Google Scholar
Z. Zhou, N. Li, C. Fan and T. Helleseth, Linear codes with two or three weights from quadratic Bent functions, Des. Codes Cryptogr., 81 (2016), 283-295. doi: 10.1007/s10623-015-0144-9. Google Scholar
Table 1. Weight enumerators of Theorem 3.2 for odd $tm$
Weight Frequency
$(p-1)p^{tm-2}$ $p^{tm-1}-1$
$(p-1)(p^{tm-2}-p^{\frac {tm-3} 2})$ $\frac {p-1} 2(p^{tm-1}+p^{\frac {tm-1} 2})$
$(p-1)(p^{tm-2}+p^{\frac {tm-3} 2})$ $\frac {p-1} 2(p^{tm-1}-p^{\frac {tm-1} 2})$
Table 2. Weight enumerators of Theorem 3.2 for even $tm$
$(p-1)p^{tm-2}$ $p^{tm-1}+(-1)^{(\frac {m(p-1)} 4+1)t}(p-1)p^{\frac {tm-2} 2}-1$
$(p-1)\big(p^{tm-2}+(-1)^{(\frac {m(p-1)} 4+1)t}p^{\frac {tm-2} 2}\big)$ $(p-1)\big(p^{tm-1}-(-1)^{(\frac {m(p-1)} 4+1)t}p^{\frac {tm-2} 2}\big)$
$(p-1)p^{tm-2}+(-1)^{\frac {(p-1)(tm+3)} 4}p^{\frac {tm-1} 2}+p^{\frac {tm-3} 2}$ $\frac {p-1} 2(p^{tm-1}+p^{\frac {tm-1} 2})$
$(p-1)p^{tm-2}+(-1)^{\frac {(p-1)(tm+3)} 4}p^{\frac {tm-1} 2}-p^{\frac {tm-3} 2}$ $\frac {p-1} 2(p^{tm-1}-p^{\frac {tm-1} 2})$
$2 \nmid \big(\frac {m(p-1)} 4+1\big)t$
$(p-1)p^{tm-2}$ $\frac {p+1} 2p^{tm-1}-\frac {p-1} 2 p^{\frac {tm-2} 2}-1$
$(p-1)p^{tm-2}+2p^{\frac {tm-2} 2}$ $\frac {p-1} 2\big(p^{tm-1}+p^{\frac {tm-2} 2}\big)$
$2 \mid \big(\frac {m(p-1)} 4+1\big)t$
$(p-1)p^{tm-2}$ $\frac {p+1} 2p^{tm-1}+\frac {p-1} 2 p^{\frac {tm-2} 2}-1$
$(p-1)p^{tm-2}-2p^{\frac {tm-2} 2}$ $\frac {p-1} 2\big(p^{tm-1}-p^{\frac {tm-2} 2}\big)$
Table 6. Complete weight enumerators of Theorem 5.1 for odd $tm$
$N_0=n-\sum_{\rho \in \Bbb F_p^*}N_\rho$
$N_\rho (\rho \in \Bbb F_p^*)$ Frequency
$p^{tm-2}$ $p^{tm-1}-1$
$p^{tm-2}-p^{\frac {tm-3} 2}$ $\frac {p-1} 2(p^{tm-1}+p^{\frac {tm-1} 2})$
$p^{tm-2}+p^{\frac {tm-3} 2}$ $\frac {p-1} 2(p^{tm-1}-p^{\frac {tm-1} 2})$
Table 7. Complete weight enumerators of Theorem 5.1 for even $tm$
$p^{tm-2}$ $p^{tm-1}+(-1)^{(\frac {m(p-1)} 4+1)t}(p-1)p^{\frac {tm-2} 2}-1$
$p^{tm-2}+(-1)^{(\frac {m(p-1)} 4+1)t}p^{\frac {tm-2} 2}$ $(p-1)\big(p^{tm-1}-(-1)^{(\frac {m(p-1)} 4+1)t}p^{\frac {tm-2} 2}\big)$
Dandan Wang, Xiwang Cao, Gaojun Luo. A class of linear codes and their complete weight enumerators. Advances in Mathematics of Communications, 2021, 15 (1) : 73-97. doi: 10.3934/amc.2020044
Fengwei Li, Qin Yue, Xiaoming Sun. The values of two classes of Gaussian periods in index 2 case and weight distributions of linear codes. Advances in Mathematics of Communications, 2021, 15 (1) : 131-153. doi: 10.3934/amc.2020049
Xiangrui Meng, Jian Gao. Complete weight enumerator of torsion codes. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020124
Shudi Yang, Xiangli Kong, Xueying Shi. Complete weight enumerators of a class of linear codes over finite fields. Advances in Mathematics of Communications, 2021, 15 (1) : 99-112. doi: 10.3934/amc.2020045
Hongming Ru, Chunming Tang, Yanfeng Qi, Yuxiao Deng. A construction of $ p $-ary linear codes with two or three weights. Advances in Mathematics of Communications, 2021, 15 (1) : 9-22. doi: 10.3934/amc.2020039
Vito Napolitano, Ferdinando Zullo. Codes with few weights arising from linear sets. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020129
Shanding Xu, Longjiang Qu, Xiwang Cao. Three classes of partitioned difference families and their optimal constant composition codes. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020120
Jong Yoon Hyun, Boran Kim, Minwon Na. Construction of minimal linear codes from multi-variable functions. Advances in Mathematics of Communications, 2021, 15 (2) : 227-240. doi: 10.3934/amc.2020055
Agnaldo José Ferrari, Tatiana Miguel Rodrigues de Souza. Rotated $ A_n $-lattice codes of full diversity. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020118
San Ling, Buket Özkaya. New bounds on the minimum distance of cyclic codes. Advances in Mathematics of Communications, 2021, 15 (1) : 1-8. doi: 10.3934/amc.2020038
Karan Khathuria, Joachim Rosenthal, Violetta Weger. Encryption scheme based on expanded Reed-Solomon codes. Advances in Mathematics of Communications, 2021, 15 (2) : 207-218. doi: 10.3934/amc.2020053
Nicola Pace, Angelo Sonnino. On the existence of PD-sets: Algorithms arising from automorphism groups of codes. Advances in Mathematics of Communications, 2021, 15 (2) : 267-277. doi: 10.3934/amc.2020065
Sabira El Khalfaoui, Gábor P. Nagy. On the dimension of the subfield subcodes of 1-point Hermitian codes. Advances in Mathematics of Communications, 2021, 15 (2) : 219-226. doi: 10.3934/amc.2020054
Tingting Wu, Li Liu, Lanqiang Li, Shixin Zhu. Repeated-root constacyclic codes of length $ 6lp^s $. Advances in Mathematics of Communications, 2021, 15 (1) : 167-189. doi: 10.3934/amc.2020051
Saadoun Mahmoudi, Karim Samei. Codes over $ \frak m $-adic completion rings. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020122
Hongwei Liu, Jingge Liu. On $ \sigma $-self-orthogonal constacyclic codes over $ \mathbb F_{p^m}+u\mathbb F_{p^m} $. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020127
Ivan Bailera, Joaquim Borges, Josep Rifà. On Hadamard full propelinear codes with associated group $ C_{2t}\times C_2 $. Advances in Mathematics of Communications, 2021, 15 (1) : 35-54. doi: 10.3934/amc.2020041
Yuan Cao, Yonglin Cao, Hai Q. Dinh, Ramakrishna Bandi, Fang-Wei Fu. An explicit representation and enumeration for negacyclic codes of length $ 2^kn $ over $ \mathbb{Z}_4+u\mathbb{Z}_4 $. Advances in Mathematics of Communications, 2021, 15 (2) : 291-309. doi: 10.3934/amc.2020067
Hai Q. Dinh, Bac T. Nguyen, Paravee Maneejuk. Constacyclic codes of length $ 8p^s $ over $ \mathbb F_{p^m} + u\mathbb F_{p^m} $. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020123
PDF downloads (272)
HTML views (397)
Chengju Li Sunghan Bae Shudi Yang