On Near-MDS Elliptic Codes

Simple item page
dc.creatorGiulietti, Massimo
dc.date2002-11-06
dc.date.accessioned2026-07-07T08:18:11Z
dc.date.available2026-07-07T08:18:11Z
dc.descriptionThe main conjecture on maximum distance separable (MDS) codes states that, execpt for some special cases, the maximum length of a q-ary linear MDS code is q+1. This conjecture does not hold true for near maximum distance separable codes because of the existence of q-ary near MDS elliptic codes having length bigger than q+1. An interesting related question is whether a near MDS elliptic code can be extended to a longer near MDS code. Our results are some non-extendability results and an alternative and simpler construction for certain known near MDS elliptic codes.
dc.descriptionLatex 2e, 13 pages
dc.identifierhttps://arxiv.org/abs/math/0211107
dc.identifierhttp://arxiv.org/abs/math/0211107
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134346
dc.subjectAlgebraic Geometry
dc.subjectInformation Theory
dc.subjectCombinatorics
dc.subject51E22;14H52
dc.titleOn Near-MDS Elliptic Codes
dc.typetext

Files

Collections

arXiv