New Classes of p-Ary Few Weight Codes

  • Minjia ShiEmail author
  • Rongsheng Wu
  • Liqin Qian
  • Lin Sok
  • Patrick Solé


In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring \(R=\mathbb {F}_p+u\mathbb {F}_p+\cdots +u^{k-1}\mathbb {F}_{p},\) with \(u^k=0,\) are constructed that generalize the construction of Shi et al. (IEEE Commun. Lett. 20(12):2346–2349, 2016), which is the special case of \(p=k=2.\) These codes are defined as trace codes. In some cases of their defining sets, they are abelian. Their homogeneous weight distributions are computed by using exponential sums. In particular, in the two-weight case, we give some conditions of optimality of their Gray images by using the Griesmer bound. Their dual homogeneous distance is also given. The codewords of these codes are shown to be minimal for inclusion of supports, a fact favorable to an application to secret sharing schemes.


Two-weight codes Three-weight codes Homogeneous distance Gray map 


  1. 1.
    Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010–2017 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Blakley, G.R.: Safeguarding cryptographic keys. Proc. Natl. Comput. Conf. N. Y. 1979, 313–317 (1979)Google Scholar
  3. 3.
    Calderbank, R., Kantor, W.M.: The geometry of two-weight codes. Bul. Lond. Math. Soc. 18(2), 97–122 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Delsarte, P.: Weights of linear codes and strongly regular normed spaces. Discrete Math. 3(1–3), 47–64 (1972)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Ding, C., Li, C., Li, N., Zhou, Z.: Three-weight cyclic codes and their weight distributions. Discrete Math. 339(2), 415–427 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Ding, C., Yuan, J.: Covering and secret sharing with linear codes. Lecture Notes Comput. Sci. 2731, 11–25 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Ding, C., Yang, J.: Hamming weights in irreducible cyclic codes. Discrete Math. 313(4), 434–446 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Ding, K., Ding, C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835–5842 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Griesmer, J.H.: A bound for error-correcting codes. IBM J. Res. Dev. 4(5), 532–542 (1960)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Greferath, M., Schmidt, S.E.: Gray isometries for finite chain rings and a nonlinear ternary \((36, 3^{12}, 15)\) code. IEEE Trans. Inf. Theory 45(7), 2522–2524 (1999)CrossRefzbMATHGoogle Scholar
  11. 11.
    Heng, Z., Yue, Q.: A class of binary codes with at most three weights. IEEE Commun. Lett. 19(9), 1488–1491 (2015)CrossRefGoogle Scholar
  12. 12.
    Heng, Z., Yue, Q.: A Class of \(q\)-ary Linear Codes Derived from Irreducible Cyclic Codes (2015).
  13. 13.
    MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Pub. Co., Amsterdam (1977)zbMATHGoogle Scholar
  14. 14.
    Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish–Russian Workshop on Information Theory, M\(\ddot{o}\)lle, Sweden, pp. 276–279 (1993)Google Scholar
  15. 15.
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Shi, M., Liu, Y., Solé, P.: Optimal two-weight codes from trace codes over \(\mathbb{F}_2+u\mathbb{F}_2\). IEEE Commun. Lett. 20(12), 2346–2349 (2016)CrossRefGoogle Scholar
  17. 17.
    Shi, M., Liu, Y., Solé, P.: Optimal binary codes from trace codes over a non-chain ring. Discrete Appl. Math. 219, 176–181 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Shi, M., Wu, R., Liu, Y., Solé, P.: Two and three weight codes over \(\mathbb{F}_p+u\mathbb{F}_p\). Cryptogr. Commun. 9(5), 637–646 (2017)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Shi, M., Zhu, S., Yang, S.: A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb{F}_p[u]/(u^m)\). J. Frankl. Inst. 350(5), 929–937 (2013)CrossRefzbMATHGoogle Scholar
  20. 20.
    Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206–212 (2006)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia 2017

Authors and Affiliations

  • Minjia Shi
    • 1
    • 2
    • 3
    Email author
  • Rongsheng Wu
    • 2
  • Liqin Qian
    • 2
  • Lin Sok
    • 2
    • 4
  • Patrick Solé
    • 5
  1. 1.Key Laboratory of Intelligent Computing & Signal ProcessingMinistry of Education, Anhui UniversityHefeiP. R. China
  2. 2.School of Mathematical SciencesAnhui UniversityHefeiP. R. China
  3. 3.National Mobile Communications Research LaboratorySoutheast UniversityNanjingP. R. China
  4. 4.Department of MathematicsRoyal University of Phnom PenhPhnom PenhCambodia
  5. 5.CNRS/LAGAUniversity of Paris 8Saint-DenisFrance

Personalised recommendations