Conjectural upper bounds on the smallest size of a complete arc in PG(2,q) based on an analysis of step-by-step greedy algorithms, in Proceedings XIV International Workshop on Algebraic and Combinatorial Coding Theory, ACCT2014, Svetlogorsk , Russia, 2014, 24-31
Go to publication Download (188.6 KB)
| Authors: Bartoli D., Davydov A., Faina G., Kreshchuk A., Marcugini S., Pambianco F. |