Minimum distance of elliptic codes (Q1191728)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum distance of elliptic codes |
scientific article |
Statements
Minimum distance of elliptic codes (English)
0 references
27 September 1992
0 references
The author examine three series of linear codes arising from elliptic curves. An \((n,k,d)\) code defined over an elliptic curve is almost maximum distance separable one that is \(d=n-k+1\) or \(d=n-k\). One of the most important properties of an elliptic function field defined over a fixed finite field \(Q\) is the fact that there is a bijection from its class group onto its set of prime divisors of degree one. This map is used in this paper to compute the minimal distance of the above-mentioned family of codes. In almost all cases these codes are not maximum distance separable, so \(d=n-k\). It is interesting that the MDS codes one obtains in the ``trivial'' cases belong to the class of generalized Reed-Solomon codes.
0 references
maximum distance separable codes
0 references
elliptic curves
0 references
elliptic function field
0 references
minimal distance
0 references
MDS codes
0 references
generalized Reed-Solomon codes
0 references