Journal article
M. Giulietti
Applicable Algebra in Engineering, Communication and Computing, 2004
Applicable Algebra in Engineering, Communication and Computing, 2004
Semantic Scholar
DBLP
DOI
Cite
Cite
APA
Click to copy
Giulietti, M. (2004). On the Extendibility of Near-MDS Elliptic Codes. Applicable Algebra in Engineering, Communication and Computing.
Chicago/Turabian
Click to copy
Giulietti, M. “On the Extendibility of Near-MDS Elliptic Codes.” Applicable Algebra in Engineering, Communication and Computing (2004).
MLA
Click to copy
Giulietti, M. “On the Extendibility of Near-MDS Elliptic Codes.” Applicable Algebra in Engineering, Communication and Computing, 2004.
BibTeX Click to copy
@article{m2004a,
title = {On the Extendibility of Near-MDS Elliptic Codes},
year = {2004},
journal = {Applicable Algebra in Engineering, Communication and Computing},
author = {Giulietti, M.}
}
Abstract
Abstract.The Main Conjecture on maximum distance separable (MDS) codes states that, except for some special cases, the maximum length of a q-ary linear MDS code of 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 may be extended to a longer near-MDS code. In this paper we prove some non-extendibility results for certain near-MDS elliptic codes.
