1. Ball S.: Table of bounds on three dimensional linear codes or (n,r) arcs in PG(2,q). https://mat-web.upc.edu/people/simeon.michael.ball/codebounds.html .
2. Ball S., Hill R., Landjev I., Ward H.N.: On $$(q^2+q+2, q+2)$$ ( q 2 + q + 2 , q + 2 ) -arcs in the projective plane $$PG(2, q)$$ P G ( 2 , q ) . Des. Codes Cryptogr. 24, 205–224 (2001).
3. 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).
4. Brouwer A.: Bounds on the minimum distance of linear codes. In: Pless V., Huffman W.C. (eds.) Handbook of Coding Theory, pp. 295–461. Elsevier, New York (1998).
5. Dodunekov S.: Optimal codes, DSc Thesis, Institute of Mathematics, Sofia (1985).