{"paper":{"title":"Linear codes from Denniston maximal arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Maria Montanucci, Massimo Giulietti","submitted_at":"2017-11-28T09:29:42Z","abstract_excerpt":"In this paper we construct functional codes from Denniston maximal arcs. For $q=2^{4n+2}$ we obtain linear codes with parameters $[(\\sqrt{q}-1)(q+1),5,d]_q$ where $\\lim_{q \\to +\\infty} d=(\\sqrt{q}-1)q-3\\sqrt{q}$. We also find for $q=16,32$ a number of linear codes which appear to have larger minimum distance with respect to the known codes with same length and dimension."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10478","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}