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

DOI10.1007/S10623-013-9837-0zbMATH Open1321.94119arXiv1201.2260OpenAlexW8314386MaRDI QIDQ2249649FDOQ2249649

Daniele Bartoli, Fernanda Pambianco, Stefano Marcugini

Publication date: 3 July 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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).


Full work available at URL: https://arxiv.org/abs/1201.2260




Recommendations




Cites Work


Cited In (13)

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)