AbstractUsing maximal arcs in PG(3, 2m), we give a new proof of the fact that the binary cyclic code C(m)1, 22h−2h+1, the code of length 2m−1 with defining zeroes α and αt, t=22h−2h+1, where α is a primitive element in GF(2m), is 2-error-correcting when gcd(m, h)=1
AbstractIn this paper we determine the largest size of a complete (n,3)-arc in PG(2,11). By a comput...
AbstractThis article reviews some of the principal and recently-discovered lower and upper bounds on...
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
AbstractUsing maximal arcs in PG(3, 2m), we give a new proof of the fact that the binary cyclic code...
We consider a class of 3-error-correcting cyclic codes of length 2^m −1 over the two-element field F...
It is proved that for every d≥2 such that d−1 divides q−1 , where q is a power of 2, there exists a ...
AbstractA (k,r)-arc is a set of k points of a projective plane such that some r, but no r+1 of them,...
In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs ass...
Let C be a code of length k over an alphabet A of size q greather or equal 2. Having chosen m with 2...
We prove that 15 is the maximal size of a 3-arc in the projective plane of order 8. 1 Introduction ...
Cyclic codes give us the most probable method by which we may detect and correct data transmission e...
By a classical result of Bonisoli, the equidistant linear codes over GF(q) are, up to monomial equiv...
An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of the...
This article reviews some of the principal and recently-discovered lower and upper bounds on the max...
General error locator polynomials were introduced in 2005 as an alternative decoding for cyclic code...
AbstractIn this paper we determine the largest size of a complete (n,3)-arc in PG(2,11). By a comput...
AbstractThis article reviews some of the principal and recently-discovered lower and upper bounds on...
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
AbstractUsing maximal arcs in PG(3, 2m), we give a new proof of the fact that the binary cyclic code...
We consider a class of 3-error-correcting cyclic codes of length 2^m −1 over the two-element field F...
It is proved that for every d≥2 such that d−1 divides q−1 , where q is a power of 2, there exists a ...
AbstractA (k,r)-arc is a set of k points of a projective plane such that some r, but no r+1 of them,...
In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs ass...
Let C be a code of length k over an alphabet A of size q greather or equal 2. Having chosen m with 2...
We prove that 15 is the maximal size of a 3-arc in the projective plane of order 8. 1 Introduction ...
Cyclic codes give us the most probable method by which we may detect and correct data transmission e...
By a classical result of Bonisoli, the equidistant linear codes over GF(q) are, up to monomial equiv...
An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of the...
This article reviews some of the principal and recently-discovered lower and upper bounds on the max...
General error locator polynomials were introduced in 2005 as an alternative decoding for cyclic code...
AbstractIn this paper we determine the largest size of a complete (n,3)-arc in PG(2,11). By a comput...
AbstractThis article reviews some of the principal and recently-discovered lower and upper bounds on...
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
DOI
Add to ORKG