Skip to main content
Log in

Few-weight \({\pmb {{\mathbb {Z}}}}_p\pmb {{\mathbb {Z}}}_p[u]\)-additive codes from down-sets

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

In this paper, we study a special class of \({\mathbb {Z}}_p{\mathbb {Z}}_p[u]\)-additive code \(C_L\) defined in terms of the down-set, where \(u^2=u\) and p is an odd prime. By a proper choice of the down-set, we determine the weight distribution of the additive code \(C_L\). In particular, we obtain several infinite families of minimal and optimal few-weight p-codes via the Gray map, and these codes can be applied 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.

Similar content being viewed by others

References

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

    Article  MathSciNet  Google Scholar 

  2. Chang, S., Hyun, J.Y.: Linear codes from simplicial complexes. Des. Codes Crytogr. 86(10), 2167–2181 (2018)

    Article  MathSciNet  Google Scholar 

  3. Diao, L., Gao, J., Lu, J.: Some results on \({\mathbb{Z}}_p{\mathbb{Z}}_p[v]\)-additive cyclic codes. Adv. Math. Commun. 14, 555–572 (2020)

    Article  MathSciNet  Google Scholar 

  4. 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  Google Scholar 

  5. Ding, C., Helleseth, T., Klove, T., Wang, X.: A general construction of cartesian authentication codes. IEEE Trans. Inf. Theory 53(6), 2229–2235 (2007)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Hyun, J.Y., Hyun, K.K., Na, M.: Optimal non-projective linear codes constructed from down-sets. Discrete Appl. Math. 254, 135–145 (2019)

    Article  MathSciNet  Google Scholar 

  8. Li, X., Shi, M.: A new family of optimal binary few-weight codes from simplical complexes. IEEE Commun. Lett. PP(99), 1 (2020)

    Google Scholar 

  9. Shi, M., Guan, Y., Solé, P.: Two new families of two-weight codes. IEEE Trans. Inf. Theory 63, 6240–6246 (2017)

    Article  MathSciNet  Google Scholar 

  10. Shi, M., Guan, Y., Solé, P.: Few-weight codes from trace codes over \(R_k\). Bull. Aust. Math. Soc. 98, 167–174 (2018)

    Article  MathSciNet  Google Scholar 

  11. Shi, M., Huang, D., Solé, P.: Optimal ternary cubic two-weight codes. Chin. J. Electron. 27, 734–738 (2018)

    Article  Google Scholar 

  12. Shi, M., Li, X.: Two classes of optimal \(p\)-ary few-weight codes from down-sets. Discrete Appl. Math. 290(5), 60–67 (2021)

    Article  MathSciNet  Google Scholar 

  13. 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, 2346–2349 (2016)

    Article  Google Scholar 

  14. Shi, M., Qian, L., Solé, P.: Few-weight codes from trace codes over a local ring. Appl. Algebra Eng. Commun. Comput. 29, 335–350 (2018)

    Article  MathSciNet  Google Scholar 

  15. Shi, M., Wu, R., Qian, L., Solé, P.: New classes of p-ary few weight codes. Bull. Malays. Math. Sci. Soc. 42, 1393–1412 (2019)

    Article  MathSciNet  Google Scholar 

  16. Shi, M., Zhu, H., Solé, P.: Three-weight codes and the cubic construction. Appl. Comput. Math 17, 175–184 (2018)

    MathSciNet  MATH  Google Scholar 

  17. Shi, M., Wang, C., Wu, R., Hu, Y., Chang, Y.: One-weight and two-weigth \({\mathbb{Z}}_2{\mathbb{Z}}_2[u, v]\)-additive codes. Cryptogr. Commun. 12, 443–454 (2020)

    Article  MathSciNet  Google Scholar 

  18. Wu, Y., Zhu, X., Yue, Q.: Optimal few-weight codes from simplicial complexes. IEEE Trans. Inf. Theory 66(6), 3657–3663 (2020)

    Article  MathSciNet  Google Scholar 

  19. Wu, Y., Hyun, J.Y.: Few-weight codes over \({\mathbb{F}}_p +u{\mathbb{F}}_p\) associated with down sets and their distance optimal gray image. Discrete Appl. Math. 283, 315–322 (2020)

    Article  MathSciNet  Google Scholar 

  20. Wu, R., Shi, M.: Some classes of mixed alphabet codes with few weights. IEEE Commun. Lett. 25, 1431–1434 (2021)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Minjia Shi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The work of M. Shi is supported by the National Natural Science Foundation of China (12071001), the Excellent Youth Foundation of Natural Science Foundation of Anhui Province (1808085J20).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, S., Shi, M. Few-weight \({\pmb {{\mathbb {Z}}}}_p\pmb {{\mathbb {Z}}}_p[u]\)-additive codes from down-sets. J. Appl. Math. Comput. 68, 2381–2388 (2022). https://doi.org/10.1007/s12190-021-01594-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-021-01594-x

Keywords

Mathematics Subject Classification

Navigation