Complete (Formula presented.) -arcs in projective planes over finite fields are the geometric counterpart of linear non-extendible Near MDS codes of length (Formula presented.) and dimension (Formula presented.). A class of infinite families of complete (Formula presented.) -arcs in (Formula presented.) is constructed, for (Formula presented.) a power of an odd prime (Formula presented.). The order of magnitude of (Formula presented.) is smaller than (Formula presented.). This property significantly distinguishes the complete (Formula presented.) -arcs of this paper from the previously known infinite families, whose size differs from (Formula presented.) by at most (Formula presented.).
Bartoli, D., Giulietti, M., Zini, G. (2016). Complete (k,3)-arcs from quartic curves. DESIGNS, CODES AND CRYPTOGRAPHY, 79(3), 487-505 [10.1007/s10623-015-0073-7].
Complete (k,3)-arcs from quartic curves
Zini, G
2016
Abstract
Complete (Formula presented.) -arcs in projective planes over finite fields are the geometric counterpart of linear non-extendible Near MDS codes of length (Formula presented.) and dimension (Formula presented.). A class of infinite families of complete (Formula presented.) -arcs in (Formula presented.) is constructed, for (Formula presented.) a power of an odd prime (Formula presented.). The order of magnitude of (Formula presented.) is smaller than (Formula presented.). This property significantly distinguishes the complete (Formula presented.) -arcs of this paper from the previously known infinite families, whose size differs from (Formula presented.) by at most (Formula presented.).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.