Skip to main content
Log in

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010–2017 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blakley, G.R.: Safeguarding cryptographic keys. Proc. Natl. Comput. Conf. N. Y. 1979, 313–317 (1979)

    Google Scholar 

  3. Calderbank, R., Kantor, W.M.: The geometry of two-weight codes. Bul. Lond. Math. Soc. 18(2), 97–122 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. Delsarte, P.: Weights of linear codes and strongly regular normed spaces. Discrete Math. 3(1–3), 47–64 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ding, C., Li, C., Li, N., Zhou, Z.: Three-weight cyclic codes and their weight distributions. Discrete Math. 339(2), 415–427 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ding, C., Yuan, J.: Covering and secret sharing with linear codes. Lecture Notes Comput. Sci. 2731, 11–25 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ding, C., Yang, J.: Hamming weights in irreducible cyclic codes. Discrete Math. 313(4), 434–446 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  9. Griesmer, J.H.: A bound for error-correcting codes. IBM J. Res. Dev. 4(5), 532–542 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  11. Heng, Z., Yue, Q.: A class of binary codes with at most three weights. IEEE Commun. Lett. 19(9), 1488–1491 (2015)

    Article  Google Scholar 

  12. Heng, Z., Yue, Q.: A Class of \(q\)-ary Linear Codes Derived from Irreducible Cyclic Codes (2015). http://arxiv.org/abs/1511.09174

  13. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Pub. Co., Amsterdam (1977)

    MATH  Google Scholar 

  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)

  15. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  20. Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206–212 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Minjia Shi.

Additional information

Communicated by Miin Huey Ang.

This research of the first author is supported by National Natural Science Foundation of China (61672036), Technology Foundation for Selected Overseas Chinese Scholar, Ministry of Personnel of China (05015133), and the Open Research Fund of National Mobile Communications Research Laboratory, Southeast University (2015D11), and Key projects of support program for outstanding young talents in Colleges and Universities (gxyqZD2016008). The third author is supported by the Project of Graduate Academic Innovation of Anhui University (No. yfc100015) and the fourth author is supported by China Postdoctoral Science Foundation funded project (2016M601991).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, M., Wu, R., Qian, L. et al. New Classes of p-Ary Few Weight Codes. Bull. Malays. Math. Sci. Soc. 42, 1393–1412 (2019). https://doi.org/10.1007/s40840-017-0553-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40840-017-0553-1

Keywords

Navigation