May 2018, 12(2): 415-428. doi: 10.3934/amc.2018025

On some classes of codes with a few weights

1. 

School of Computer Science & Technology, Beijing Institute of Technology, Beijing 100081, China

2. 

Department of Mathematics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing 100081, China

* Corresponding author: Zhimin Sun

Received  June 2017 Revised  February 2018 Published  March 2018

Fund Project: This work was supported by The National Science Foundation of China (No. 11171366)

We generalize the code constructed recently by Wang et al, and obtain many classes of codes with a few weights. The weight distribution of these codes is completely determined, and the minimum distance of the duals of these codes is determined. We also show that some subclasses of the duals of these codes are optimal. Furthermore, some parameters of the generalized Hamming weight of these codes are calculated in certain cases.

Citation: Yiwei Liu, Zihui Liu. On some classes of codes with a few weights. Advances in Mathematics of Communications, 2018, 12 (2) : 415-428. doi: 10.3934/amc.2018025
References:
[1]

A. R. AndersonC. DingT. Helleseth and T. Kløve, How to build robust shared control systems, Des., Codes Cryptogr., 15 (1998), 111-124. doi: 10.1023/A:1026421315292.

[2]

C. CarletC. 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.

[3]

K. Ding and C. Ding, Bianry linear codes with three weights, IEEE Commun. Lett., 18 (2014), 1879-1882.

[4]

C. DingT. HellesethT. Kløve and X. Wang, A general construction of authentication codes, IEEE Trans. Inf. Theory, 53 (2007), 2229-2235. doi: 10.1109/TIT.2007.896872.

[5]

G. D. Forney, Dimension/length profiles and trellis complexity of linear block codes, IEEE Trans. Inf. Theory, 40 (1994), 1741-1752. doi: 10.1109/18.340452.

[6]

W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, Cambridge, 2003.

[7]

R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge, 1997.

[8]

M. Moisio, Explicit evaluation of some exponential sums, Finite Fields Their Appl., 15 (2009), 644-651. doi: 10.1016/j.ffa.2009.05.005.

[9]

Q. WangK. Ding and R. Xue, Binary linear codes with two weights, IEEE Commun. Lett., 19 (2015), 1097-1100. doi: 10.1109/LCOMM.2015.2431253.

[10]

Q. WangK. DingD. D. Lin and R. Xue, A kind of three-weight linear codes, Cryptogr. Commun., 9 (2017), 315-322. doi: 10.1007/s12095-015-0180-3.

[11]

V. K. Wei, Generalized Hamming weights for linear codes, IEEE Trans. Inf. Theory, 37 (1991), 1412-1418. doi: 10.1109/18.133259.

[12]

M. H. YangJ. LiK. Q. Feng and D. D. Lin, Generalized Hamming weights of irreducible cyclic codes, IEEE Trans. Inf. Theory, 61 (2015), 4905-4913. doi: 10.1109/TIT.2015.2444013.

[13]

J. Yuan and C. Ding, Secret sharing schemes from two-weight codes, Electronic Notes in Discrete Mathematics, 15 (2003), P232. doi: 10.1016/S1571-0653(04)00592-X.

[14]

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.

show all references

References:
[1]

A. R. AndersonC. DingT. Helleseth and T. Kløve, How to build robust shared control systems, Des., Codes Cryptogr., 15 (1998), 111-124. doi: 10.1023/A:1026421315292.

[2]

C. CarletC. 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.

[3]

K. Ding and C. Ding, Bianry linear codes with three weights, IEEE Commun. Lett., 18 (2014), 1879-1882.

[4]

C. DingT. HellesethT. Kløve and X. Wang, A general construction of authentication codes, IEEE Trans. Inf. Theory, 53 (2007), 2229-2235. doi: 10.1109/TIT.2007.896872.

[5]

G. D. Forney, Dimension/length profiles and trellis complexity of linear block codes, IEEE Trans. Inf. Theory, 40 (1994), 1741-1752. doi: 10.1109/18.340452.

[6]

W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, Cambridge, 2003.

[7]

R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge, 1997.

[8]

M. Moisio, Explicit evaluation of some exponential sums, Finite Fields Their Appl., 15 (2009), 644-651. doi: 10.1016/j.ffa.2009.05.005.

[9]

Q. WangK. Ding and R. Xue, Binary linear codes with two weights, IEEE Commun. Lett., 19 (2015), 1097-1100. doi: 10.1109/LCOMM.2015.2431253.

[10]

Q. WangK. DingD. D. Lin and R. Xue, A kind of three-weight linear codes, Cryptogr. Commun., 9 (2017), 315-322. doi: 10.1007/s12095-015-0180-3.

[11]

V. K. Wei, Generalized Hamming weights for linear codes, IEEE Trans. Inf. Theory, 37 (1991), 1412-1418. doi: 10.1109/18.133259.

[12]

M. H. YangJ. LiK. Q. Feng and D. D. Lin, Generalized Hamming weights of irreducible cyclic codes, IEEE Trans. Inf. Theory, 61 (2015), 4905-4913. doi: 10.1109/TIT.2015.2444013.

[13]

J. Yuan and C. Ding, Secret sharing schemes from two-weight codes, Electronic Notes in Discrete Mathematics, 15 (2003), P232. doi: 10.1016/S1571-0653(04)00592-X.

[14]

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.

Table 1.  The weight distribution of the code $\mathcal{C}_{A}$ in Theorem 5
WeightMultiplicity
01
$\frac{q+\sqrt{q}}{4}+\frac{q+\sqrt{q}}{4r^{m}}S(a)$$\frac{q-1}{2}-\frac{q-1}{2r^{m}}S(a)$
$\frac{q-\sqrt{q}}{4}+\frac{q+\sqrt{q}}{4r^{m}}S(a)$$\frac{q-1}{2}+\frac{q-1}{2r^{m}}S(a)$
WeightMultiplicity
01
$\frac{q+\sqrt{q}}{4}+\frac{q+\sqrt{q}}{4r^{m}}S(a)$$\frac{q-1}{2}-\frac{q-1}{2r^{m}}S(a)$
$\frac{q-\sqrt{q}}{4}+\frac{q+\sqrt{q}}{4r^{m}}S(a)$$\frac{q-1}{2}+\frac{q-1}{2r^{m}}S(a)$
Table 2.  The weight distribution of the code $\mathcal{C}_{A}$ in Theorem 10
WeightMultiplicity
01
$\frac{q}{4}$$\frac{q-3}{2}+(-1)^{\textrm{wt}(\boldsymbol{c}^{(0)})}\frac{q-1}{2r^{m}}S(a)$
$\frac{q+(-1)^{\textrm{wt}(\boldsymbol{c}^{(0)})}2\sqrt{q}}{4}$$\frac{q-1}{2}-(-1)^{\textrm{wt}(\boldsymbol{c}^{(0)})}\frac{q-1}{2r^{m}}S(a)$
$\frac{q+(-1)^{\textrm{wt}(\boldsymbol{c}^{(0)})}\sqrt{q}}{4}-\frac{q+\sqrt{q}}{4r^{m}}S(a)$1
WeightMultiplicity
01
$\frac{q}{4}$$\frac{q-3}{2}+(-1)^{\textrm{wt}(\boldsymbol{c}^{(0)})}\frac{q-1}{2r^{m}}S(a)$
$\frac{q+(-1)^{\textrm{wt}(\boldsymbol{c}^{(0)})}2\sqrt{q}}{4}$$\frac{q-1}{2}-(-1)^{\textrm{wt}(\boldsymbol{c}^{(0)})}\frac{q-1}{2r^{m}}S(a)$
$\frac{q+(-1)^{\textrm{wt}(\boldsymbol{c}^{(0)})}\sqrt{q}}{4}-\frac{q+\sqrt{q}}{4r^{m}}S(a)$1
[1]

Sergio R. López-Permouth, Steve Szabo. On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings. Advances in Mathematics of Communications, 2009, 3 (4) : 409-420. doi: 10.3934/amc.2009.3.409

[2]

Alexander Barg, Arya Mazumdar, Gilles Zémor. Weight distribution and decoding of codes on hypergraphs. Advances in Mathematics of Communications, 2008, 2 (4) : 433-450. doi: 10.3934/amc.2008.2.433

[3]

Nigel Boston, Jing Hao. The weight distribution of quasi-quadratic residue codes. Advances in Mathematics of Communications, 2018, 12 (2) : 363-385. doi: 10.3934/amc.2018023

[4]

Eimear Byrne. On the weight distribution of codes over finite rings. Advances in Mathematics of Communications, 2011, 5 (2) : 395-406. doi: 10.3934/amc.2011.5.395

[5]

Lanqiang Li, Shixin Zhu, Li Liu. The weight distribution of a class of p-ary cyclic codes and their applications. Advances in Mathematics of Communications, 2019, 13 (1) : 137-156. doi: 10.3934/amc.2019008

[6]

David Keyes. $\mathbb F_p$-codes, theta functions and the Hamming weight MacWilliams identity. Advances in Mathematics of Communications, 2012, 6 (4) : 401-418. doi: 10.3934/amc.2012.6.401

[7]

Masaaki Harada, Ethan Novak, Vladimir D. Tonchev. The weight distribution of the self-dual $[128,64]$ polarity design code. Advances in Mathematics of Communications, 2016, 10 (3) : 643-648. doi: 10.3934/amc.2016032

[8]

M. L. Miotto. Multiple solutions for elliptic problem in $\mathbb{R}^N$ with critical Sobolev exponent and weight function. Communications on Pure & Applied Analysis, 2010, 9 (1) : 233-248. doi: 10.3934/cpaa.2010.9.233

[9]

Tsung-Fang Wu. On semilinear elliptic equations involving critical Sobolev exponents and sign-changing weight function. Communications on Pure & Applied Analysis, 2008, 7 (2) : 383-405. doi: 10.3934/cpaa.2008.7.383

[10]

Bagher Bagherpour, Shahrooz Janbaz, Ali Zaghian. Optimal information ratio of secret sharing schemes on Dutch windmill graphs. Advances in Mathematics of Communications, 2019, 13 (1) : 89-99. doi: 10.3934/amc.2019005

[11]

Fengwei Li, Qin Yue, Fengmei Liu. The weight distributions of constacyclic codes. Advances in Mathematics of Communications, 2017, 11 (3) : 471-480. doi: 10.3934/amc.2017039

[12]

Tim Alderson, Alessandro Neri. Maximum weight spectrum codes. Advances in Mathematics of Communications, 2019, 13 (1) : 101-119. doi: 10.3934/amc.2019006

[13]

Anuradha Sharma, Saroj Rani. Trace description and Hamming weights of irreducible constacyclic codes. Advances in Mathematics of Communications, 2018, 12 (1) : 123-141. doi: 10.3934/amc.2018008

[14]

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

[15]

Petr Lisoněk, Layla Trummer. Algorithms for the minimum weight of linear codes. Advances in Mathematics of Communications, 2016, 10 (1) : 195-207. doi: 10.3934/amc.2016.10.195

[16]

Diana M. Thomas, Ashley Ciesla, James A. Levine, John G. Stevens, Corby K. Martin. A mathematical model of weight change with adaptation. Mathematical Biosciences & Engineering, 2009, 6 (4) : 873-887. doi: 10.3934/mbe.2009.6.873

[17]

Stefka Bouyuklieva, Zlatko Varbanov. Some connections between self-dual codes, combinatorial designs and secret sharing schemes. Advances in Mathematics of Communications, 2011, 5 (2) : 191-198. doi: 10.3934/amc.2011.5.191

[18]

Ryutaroh Matsumoto. Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields. Advances in Mathematics of Communications, 2019, 13 (1) : 1-10. doi: 10.3934/amc.2019001

[19]

Guglielmo Feltrin. Positive subharmonic solutions to superlinear ODEs with indefinite weight. Discrete & Continuous Dynamical Systems - S, 2018, 11 (2) : 257-277. doi: 10.3934/dcdss.2018014

[20]

Long Yu, Hongwei Liu. A class of $p$-ary cyclic codes and their weight enumerators. Advances in Mathematics of Communications, 2016, 10 (2) : 437-457. doi: 10.3934/amc.2016017

2017 Impact Factor: 0.564

Metrics

  • PDF downloads (87)
  • HTML views (244)
  • Cited by (0)

Other articles
by authors

[Back to Top]