DOI QR코드

DOI QR Code

CONSTRUCTION OF TWO- OR THREE-WEIGHT BINARY LINEAR CODES FROM VASIL'EV CODES

  • Received : 2019.06.20
  • Accepted : 2020.09.21
  • Published : 2021.01.01

Abstract

The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.

Keywords

Acknowledgement

We express our gratitude to a reviewer for his/her very helpful comments, which improved the exposition of this paper, and wish to thank Prof. Hyun Kwang Kim for his valuable suggestions and proofreading of this paper.

References

  1. A. Ashikhmin and A. Barg, Minimal vectors in linear codes, IEEE Trans. Inform. Theory 44 (1998), no. 5, 2010-2017. https://doi.org/10.1109/18.705584
  2. R. Calderbank and W. M. Kantor, The geometry of two-weight codes, Bull. London Math. Soc. 18 (1986), no. 2, 97-122. https://doi.org/10.1112/blms/18.2.97
  3. S. Chang and J. Y. Hyun, Linear codes from simplicial complexes, Des. Codes Cryptogr. 86 (2018), no. 10, 2167-2181. https://doi.org/10.1007/s10623-017-0442-5
  4. Y. Chen and A. J. H. Vinck, A lower bound on the optimum distance profiles of the second-order Reed-Muller codes, IEEE Trans. Inform. Theory 56 (2010), no. 9, 4309-4320. https://doi.org/10.1109/TIT.2010.2054512
  5. G. D. Cohen, S. Mesnager, and A. Patey, On minimal and quasi-minimal linear codes, in Cryptography and coding, 85-98, Lecture Notes in Comput. Sci., 8308, Springer, Heidelberg, 2013. https://doi.org/10.1007/978-3-642-45239-0_6
  6. C. Ding, Z. Heng, and Z. Zhou, Minimal binary linear codes, IEEE Trans. Inform. Theory 64 (2018), no. 10, 6536-6545. https://doi.org/10.1109/TIT.2018.2819196
  7. C. Ding and J. Yuan, Covering and secret sharing with linear codes, in Discrete mathematics and theoretical computer science, 11-25, Lecture Notes in Comput. Sci., 2731, Springer, Berlin, 2003. https://doi.org/10.1007/3-540-45066-1_2
  8. T. Etzion and A. Vardy, Perfect binary codes: constructions, properties, and enumeration, IEEE Trans. Inform. Theory 40 (1994), no. 3, 754-763. https://doi.org/10.1109/18.335887
  9. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. I, North-Holland Publishing Co., Amsterdam, 1977.
  10. G. McGuire, Quasi-symmetric designs and codes meeting the Grey-Rankin bound, J. Combin. Theory Ser. A 78 (1997), no. 2, 280-291. https://doi.org/10.1006/jcta.1997.2765
  11. Ju. L. Vasil'ev, On ungrouped, close-packed codes, Problemy Kibernet. No. 8 (1962), 337-339.