Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)

  • Wenqin Zhang
  • Haode YanEmail author
  • Honglei Wei
Original Paper


As a special type of linear codes, minimal linear codes have important applications in secret sharing. Up to now, only a few infinite families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\) were reported in the literature, while vast knowledge exists on the ones with \(w_{\min }/w_{\max }> 1/2\). Herein, \(w_{\min }\) and \(w_{\max }\) respectively denote the minimum and maximum nonzero Hamming weights in a linear code. Recently, several classes of linear codes with certain properties were constructed by Zhou et al. from a generic construction. The objective of this paper is to obtain four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\) from those linear codes proposed by Zhou et al. The parameters of our minimal linear codes are quite different from known ones. Based on the properties of Krawtchouk polynomials, the weight distributions of all these four families of binary linear codes are established.


Linear codes Binary codes Minimal codes Secret sharing 

Mathematics Subject Classification

05B05 51E10 94B15 



The authors are grateful to the anonymous reviewers for careful reading and for invaluable suggestions which improve the quality of the paper. This work was supported by the National Cryptography Development Fund under Grant MMJJ20180103.


  1. 1.
    Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010–2017 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Chang, S., Hyun, J.Y.: Linear codes from simplicial complexes. Des. Codes Cryptogr. (2017). zbMATHGoogle Scholar
  3. 3.
    Ding, C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory 60(6), 3265–3275 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Ding, C.: A construction of binary linear codes from Boolean functions. Discrete Math. 339, 2288–2303 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Ding, C., Heng, Z., Zhou, Z.: Minimal binary linear codes. IEEE Trans. Inf. Theory. (2018). MathSciNetzbMATHGoogle Scholar
  6. 6.
    Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330, 81–99 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Ding, C., Li, C., Li, N., Zhou, Z.: Three-weight cyclic codes and their weight distributions. Discrete Math. 339, 415–427 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Heng, Z., Ding, C., Zhou, Z.: Minimal Linear Codes over Finite Fields. arXiv:1803.09988v1
  9. 9.
    Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)CrossRefzbMATHGoogle Scholar
  10. 10.
    MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)zbMATHGoogle Scholar
  11. 11.
    Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206–212 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Zhou, Z., Tang, C., Li, X., Ding, C.: Binary LCD codes and self-orthogonal codes from a generic construction. IEEE Trans. Inf. Theory (2018). zbMATHGoogle Scholar
  13. 13.
    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)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of MathematicsSouthwest Jiaotong UniversityChengduChina
  2. 2.State Key Laboratory of CryptologyBeijingChina
  3. 3.School of Economics and Management, National-Local Joint Engineering Laboratory of System Credibility Automatic VerificationSouthwest Jiaotong UniversityChengduChina

Personalised recommendations