A new lower bound for the smallest complete (k, n)-arc in $$\mathrm {PG}(2, q)$$ PG ( 2 , q )

S. Alabdullah, J. W. P. Hirschfeld. A new lower bound for the smallest complete (k, n)-arc in $$\mathrm {PG}(2, q)$$ PG ( 2 , q ). Des. Codes Cryptography, 87(2-3):679-683, 2019. [doi]

Abstract

Abstract is missing.