1. Ball S., Hill R., Landjev I., Ward H.N.: On $$(q^2+q+2, q+2)$$-arcs in the projective plane $$PG(2, q)$$. Des. Codes and Cryptogr. 24, 205–224 (2001).
2. Belov B.I., Logachev V.N., Sandimirov V.P.: Construction of a class of linear binary codes achieving the Varshamov-Griesmer bound. Probl. Inf. Transm. 10(3), 211–217 (1974).
3. Beutelspacher A.: Blocking sets and partial spreads in finite projective spaces. Geom. Dedicata 9, 130–157 (1980).
4. Brouwer A.: Bounds on the minimum distance of linear codes. In: Pless V., Cary Huffman W. (eds.) Handbook of Coding Theory, pp. 295–461. Elsevier, Amsterdam (1998).
5. Dodunekov S.: Optimal Codes, DSc Thesis, Institute of Mathematics, Sofia, (1985).