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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. I, North-Holland Publishing Co., Amsterdam, 1977.
- 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
- Ju. L. Vasil'ev, On ungrouped, close-packed codes, Problemy Kibernet. No. 8 (1962), 337-339.