Skip to main content

Advertisement

Springer Nature Link
Log in

A construction of q-ary linear codes with irreducible cyclic codes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Linear codes are an important class of error-correcting codes and widely used in secret sharing schemes, combinational designs, authentication codes and so on. The objective of this paper is to construct q-ary linear codes with good parameters from irreducible cyclic codes. Several classes of linear codes with a few weights including infinite families of distance-optimal ones are derived. The nonzero codewords of some of the codes in this paper have minimal support for inclusion and such codes can be used to construct secret sharing schemes with interesting access structures.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

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. Berndt B.C., Evans R.J., Williams K.S.: Gauss and Jacobi Sums. Wiley, New York (1997).

    MATH  Google Scholar 

  3. Calderbank R., Goethals J.-M.: Three-weight codes and association schemes. Philips J. Res. 39, 143–152 (1984).

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Carlet C., Ding C., Yuan J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51, 2089–2102 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  6. Chen B., Fan Y., Lin L., Liu H.: Constacyclic codes over finite fields. Finite Fields Appl. 18, 1217–1231 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  7. Ding C., Niederreiter H.: Cyclotomic linear codes of order 3. IEEE Trans. Inf. Theory 53(6), 2274–2277 (2007).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Ding C., Yuan J.: Covering and secret sharing with linear codes. In: Calude C.S., Dinneen M.J., Vajnovszki V. (eds.) DMTCS 2003, LNCS, vol. 2731, pp. 11–25. Springer, Heidelberg (2003).

  10. Ding C., Luo J., Niederreiter H.: Two-weight codes punctured from irreducible cyclic codes. In: Proceedings of the First International Workshop on Coding and Cryptology, vol. 4, pp. 11–15 (2007).

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Hamada N.: A survey of recent work on characterization of minihypers in PG($t, q$) and nonbinary codes meeting the Griesmer bound. J. Comb. Inf. Syst. Sci. 18(3–4), 161–191 (1993).

    MathSciNet  MATH  Google Scholar 

  13. Hamada N., Helleseth T.: Codes and minihypers. In: Proceedings of the EuroWorkshop on Optimal codes and related topics, pp. 79–84 (2001).

  14. Helleseth T.: A characterisation of codes meeting the Griesmer bound. Inf. Control 50(2), 128–159 (1981).

    Article  MATH  Google Scholar 

  15. Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).

    Book  MATH  Google Scholar 

  16. Kløve T.: Codes for Error Detection. World Scientfic, Singapore (2007).

    Book  MATH  Google Scholar 

  17. Li F.: A class of cyclotomic linear codes and their generalized Hamming weights. https://arxiv.org/abs/1708.04415 (2017).

  18. Li C., Bae S., Yan H.: A construction of codes with linearity from two linear codes. Cryptogr. Commun. 9(1), 55–69 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  19. Lidl R., Niederreiter H.: Finite Fields. Addison-Wesley, New York (1983).

    MATH  Google Scholar 

  20. Massey J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp. 276-279 (1993).

  21. Mesnager S.: Linear codes with few weights from weakly regular bent functions based on a generic construction. Cryptogr. Commun. 9(1), 71–84 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  22. Moisio M.J.: A note on evaluations of some exponential sums. Acta Arith. 93, 117–119 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  23. Semakov N.V., Zinoviev V.A., Zaitsev G.V.: Class of maximal equidistant codes. Probl. Inf. Transm. 5(2), 84–87 (1969).

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  25. Storme L.: Linear codes meeting the Griesmer bound, minihypers, and geometric applications. http://cage.ugent.be/~Is/preprints/artcombinatorics2004.ps.

  26. Tang C., Li N., Qi Y., Zhou Z., Helleseth T.: Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 62(3), 1166–1176 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  27. Xiang C.: It is indeed a fundamental construction of all linear codes, arXiv:1610.06355 [cs.IT].

  28. Yang Y., Cai W.: On self-dual constacyclic codes over finite fields. Des. Codes Cryptogr. 74, 355–364 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  29. Yang S., Kong X., Tang C.: A construction of linear codes and their complete weight enumerators. Finite Fields Appl. 48, 196–226 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  30. 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 

  31. Zhou Z., Li N., Fan C., Helleseth T.: Linear codes with two or three weights from quadratic Bent functions. Des. Codes Cryptogr. 81(2), 283–295 (2016).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are very grateful to the reviewers and Editors for their detailed comments that much improved the quality and presentation of this paper. This work was supported by the Hong Kong Research Grants Council, Proj. No. 16300415.

Author information

Authors and Affiliations

  1. School of Science, Chang’an University, Xi’an, 710064, China

    Ziling Heng

  2. Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China

    Ziling Heng & Cunsheng Ding

Authors
  1. Ziling Heng
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Cunsheng Ding
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ziling Heng.

Additional information

Communicated by V. A. Zinoviev.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Heng, Z., Ding, C. A construction of q-ary linear codes with irreducible cyclic codes. Des. Codes Cryptogr. 87, 1087–1108 (2019). https://doi.org/10.1007/s10623-018-0507-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-018-0507-0

Keywords

Mathematics Subject Classification