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]

Authors

S. Alabdullah

This author has not been identified. Look up 'S. Alabdullah' in Google

J. W. P. Hirschfeld

This author has not been identified. Look up 'J. W. P. Hirschfeld' in Google