On Near-MDS Elliptic Codes
نویسنده
چکیده
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. Our results are some non-extendability results and an alternative and simpler construction for certain known near-MDS elliptic codes.
منابع مشابه
On MDS elliptic codes
Munuera, C., On MDS elliptic codes, Discrete Mathematics 117 (1993) 2799286. In this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes arising from elliptic curves. Several consequences are presented.
متن کاملNew MDS or near MDS self-dual codes over finite fields
The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of q−ary MDS self-dual codes for various lengths. There are not existence of q−ary MDS self-dual codes of some lengths, even these lengths < q. We generalize MDS Euclidean self-dual codes to near MDS Euclidean self-dual codes and near MDS isodual codes. And we obtain ...
متن کاملNew constructions of MDS symbol-pair codes
Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with large minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining maximal mi...
متن کاملAG-codes on Elliptic Curves
For a secret sharing scheme, two parameters dmin and dcheat are defined in [1] and [2]. These two parameters measure the errorcorrecting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [1-3]. The MDS secret-sharing scheme is defined in [2] and it is proved that MDS perfect secret sharin...
متن کاملOn the main conjecture on geometric MDS codes
For a linear [n, k, d] code, it is well known that d ≤ n−k+1 (see [12]), and when d = n−k+1, it is called the MDS code (maximum distance separable). For every n ≤ q + 1 there is an MDS [n, k, d] code for any given k and d satisfying d = n − k + 1. It is just the geometric codes on a rational curve (see [15]). There is a long-standing conjecture about the MDS linear codes that is called the main...
متن کامل