The non-existence of some NMDS codes and the extremal sizes of complete (n,3)-arcs in PG(2,16)

From MaRDI portal
Publication:2249649




Abstract: In this work we solve the packing problem for complete (n,3)-arcs in PG(2,16), determining that the maximum size is 28 and the minimum size is 15. We also performed a partial classification of the extremal size of complete (n,3)-arcs in PG(2,16).



Cites work



Describes a project that uses

Uses Software






This page was built for publication: The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249649)