AbstractIn this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes arising from elliptic curves. Several consequences are presented
AbstractThe relation between complete arcs in a finite projective space and maximum distance separab...
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co...
AbstractComplete n-tracks in PG(N,q) and non-extendable Near MDS codes of dimension N+1 over Fq are ...
AbstractIn this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes...
AbstractIn this paper we investigate three classes of linear codes arising from elliptic curves and ...
AbstractWe construct codes generated via the recent theory of V.D. Goppa, using elliptic curves over...
For a linear maximum distance separable (MDS) code with redundancy r, the covering radius is either ...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
AbstractThe order bound gives an in general very good lower bound for the minimum distance of one-po...
AbstractWe prove that if there are consecutive gaps at a rational point on a smooth curve defined ov...
It is well known that MDS codes can be constructed as algebraic geometric (AG) codes from elliptic c...
Abstract: We prove that if there are consecutive gaps at a rational point on a smooth curve defined ...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short)...
AbstractWe propose a uniform approach to BCH codes, Goppa codes, and subfield subcodes of algebraic ...
AbstractThe relation between complete arcs in a finite projective space and maximum distance separab...
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co...
AbstractComplete n-tracks in PG(N,q) and non-extendable Near MDS codes of dimension N+1 over Fq are ...
AbstractIn this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes...
AbstractIn this paper we investigate three classes of linear codes arising from elliptic curves and ...
AbstractWe construct codes generated via the recent theory of V.D. Goppa, using elliptic curves over...
For a linear maximum distance separable (MDS) code with redundancy r, the covering radius is either ...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
AbstractThe order bound gives an in general very good lower bound for the minimum distance of one-po...
AbstractWe prove that if there are consecutive gaps at a rational point on a smooth curve defined ov...
It is well known that MDS codes can be constructed as algebraic geometric (AG) codes from elliptic c...
Abstract: We prove that if there are consecutive gaps at a rational point on a smooth curve defined ...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short)...
AbstractWe propose a uniform approach to BCH codes, Goppa codes, and subfield subcodes of algebraic ...
AbstractThe relation between complete arcs in a finite projective space and maximum distance separab...
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co...
AbstractComplete n-tracks in PG(N,q) and non-extendable Near MDS codes of dimension N+1 over Fq are ...
DOI
Add to ORKG