Skip to main content
SpringerLink
Log in

A class of affine-invariant codes and their support 2-designs

  • Sequences and Their Applications III
  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

In this paper, we first introduce a class of linear codes which are affine-invariant. Then we obtain infinite families of 2-designs from them and determine the parameters of these 2-designs by considering the weight distribution of the linear codes.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Assmus Jr., E.F., Key, J. D.: Designs and their Codes. Cambridge University Press, Cambridge (1992)

    Book  Google Scholar 

  2. Assmus Jr., E. F., Mattson Jr., H. F.: New 5-designs. J. Comb. Theory, 6, 122–151 (1969)

    Article  MathSciNet  Google Scholar 

  3. Delsarte, P.: On subfield subcodes of modified Reed-Solomon codes. IEEE Trans. Inf. Theory 21(5), 575–576 (1975)

    Article  MathSciNet  Google Scholar 

  4. Ding, C.: Codes from Difference Sets. World Scientific, Singapore (2015)

    Google Scholar 

  5. Ding, C.: Designs from Linear Codes. World Scientific, Singapore (2018)

    Book  Google Scholar 

  6. Ding, C.: An infinite family of Steiner systems S(2, 4, 2m) from cyclic codes. J. Comb. Des. 26(3), 127–144 (2018)

    Article  Google Scholar 

  7. Ding, C.: Infinite families of 3-designs from a type of five-weight code. Des. Codes Cryptogr. 86(3), 703–719 (2018)

    Article  MathSciNet  Google Scholar 

  8. Ding, C., Li, C.: Infinite families of 2-designs and 3-designs from linear codes. Discrete Math. 40(10), 2415–2431 (2017)

    Article  MathSciNet  Google Scholar 

  9. Ding, C., Tang, C.: Infinite families of near MDS codes holding t-designs. IEEE Trans. Inf. Theory 66(7), 5419–5428 (2020)

    Article  MathSciNet  Google Scholar 

  10. Ding, C., Zhou, Z.: Parameters of 2-designs from some BCH codes, Codes, Cryptography and Information Security, Lecture Notes in Computer Science. In: El Hajji, S., Nitaj, A., Souidi, E.M. (eds.) , vol. 10194, pp 110–127. Springer, Heidelberg (2017)

  11. Du, X., Wang, R., Tang, C.: Infinite families of 2-designs from two classes of linear codes, arXiv:1903.07459

  12. Du, X., Wang, R., Tang, C., Wang, Q.: Infinite families of 2-designs from linear codes, Appl. Algebr. Eng. Comm. https://doi.org/10.1007/s00200-020-00438-8(2020)

  13. Du, X., Wang, R., Fan, C.: Infinite families of 2-designs from a class of cyclic codes. J. Comb. Des. 26(3), 1–14 (2019)

    MathSciNet  Google Scholar 

  14. Kasami, T., Lin, S., Peterson, W.: Some results on cyclic codes which are invariant under the affine group and their applications. Inform Control 11, 475–496 (1968)

    Article  MathSciNet  Google Scholar 

  15. Lidl, R., Niederreiter, H.: Finite fieds. Addison-Wdsley Publishing Inc. (1983)

  16. Luo, J., Feng, K.: On the weight distribution of two classes of cyclic codes. IEEE Trans. Inf. Theory 54(12), 5332–5344 (2008)

    Article  MathSciNet  Google Scholar 

  17. Ireland, K., Rosen, M.: A classical introduction to modern number theory. Springer (1990)

  18. Tang, C., Ding, C.: An infinite family of linear codes supporting 4-designs. IEEE Trans. Inf. Theory 67(1), 244–254 (2021)

    Article  MathSciNet  Google Scholar 

  19. Tang, C., Ding, C., Xiong, M.: Steiner systems \(S(2, 4, \frac {3m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac {3m-1}{2}\). Des. Codes Crypogr. 87(12), 2793–2811 (2019)

    Article  Google Scholar 

  20. Tang, C., Ding, C., Xiong, M.: Codes, differentially δ-uniform functions and t-designs. IEEE Trans. Inf. Theory 66(6), 3691–3703 (2020)

    Article  MathSciNet  Google Scholar 

  21. Tonchev, V. D.: Codes and designs. In: Pless, V. S., Huffman, W. C. (eds.) Handbook of Coding Theory, vol. II, pp 1229–1268. Elsevier, Amsterdam (1998)

  22. Tonchev, V. D.: Codes. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs. 2nd edn., pp 677–701. CRC Press, New York (2007)

  23. Wang, R., Du, X., Fan, C.: Infinite families of 2-designs from a class of non-binary Kasami cyclic codes, arXiv:1912.04745

  24. Xu, G., Cao, X., Xu, S.: Optimal p-ary cyclic codes with minimum distance four from monomials. Cryptogr. Commun. 8(4), 541–554 (2016)

    Article  MathSciNet  Google Scholar 

  25. Zheng, D., Wang, X., Zeng, X., Hu, L.: The weight distribution of a family of p-ary cyclic codes. Des. Codes Crypogr. 75(2), 263–275 (2013)

    Article  MathSciNet  Google Scholar 

  26. Zhou, Z., Ding, C., Luo, J., Zhang, A.: A family of five-weight cyclic codes and their weight enumerators. IEEE Trans. Inf. Theory 59(10), 6674–6682 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are very grateful to the anonymous reviewers for their comments which improved the presentation and quality of this paper.

Author information

Authors and Affiliations

  1. College of Mathematics and Physics, Yancheng Institute of Technology, Yancheng, 224003, China

    Yan Liu

  2. School of Mathematical Sciences, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016, China

    Yan Liu & Xiwang Cao

Authors
  1. Yan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiwang Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiwang Cao.

Additional information

Publisher’s note

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

Y. Liu is supported by the National Natural Science Foundation of China (No. 12001475), the Natural Science Foundation of Jiangsu Province (No. BK20201059) and the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (No. 19KJB120014).

X. Cao is supported by the National Natural Science Foundation of China (No. 11771007).

This article belongs to the Topical Collection: Sequences and Their Applications III

Guest Editors: Chunlei Li, Tor Helleseth and Zhengchun Zhou

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, Y., Cao, X. A class of affine-invariant codes and their support 2-designs. Cryptogr. Commun. 14, 215–227 (2022). https://doi.org/10.1007/s12095-021-00506-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-021-00506-x

Keywords

Mathematics Subject Classification (2010)

Search

Navigation