AbstractThe weight enumerator of the binary error-correcting code generated by the rows of the incidence matrix of a projective plane of order 10 is completely determined once the numbers of code words of weight 12, 15, and 16 are known. The search for such a projective plane starting from code words of weight 16 can be divided into six cases. In his 1974 Ph.D. thesis at Berkeley, Carter finished the search for four of these cases as well as part of the fifth. This note reports the results of a computer search for the remaining cases. No projective plane of order 10 was found
An algorithm for finding wrong symbols in codewords based on using the results of checking for parit...
This repository contains SAT instances and certificates accompanying the paper "A SAT-based Resoluti...
New constructions for moderate-density parity-check (MDPC) codes using finite geometry are proposed....
Projective plane of order 10 does not exist. Proof of this assertion was finished in 1989 and is bas...
We determine the weight enumerator of the code of the projective plane of order 5 by hand. The main ...
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are s...
We study the higher weights of codes formed from planes and biplanes. We relate the higher weights o...
AbstractThere are four known finite projective planes of order 9. This paper reports the result of a...
Let Cn−1(n,q) be the code arising from the incidence of points and hyperplanes in the Desarguesian p...
In the presented work we define a class of error-correcting codes based on incidence vectors of proj...
We show that there are non-desarguesian affine planes of order 16 for which the binary codes have ve...
The minimum weight of the code generated by the incidence matrix of points versus lines in a project...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
In this paper, we study the p-ary linear code C-k (n, q), q = p(h), p prime, h >= 1, generated by th...
In this paper, we study the p-ary linear code C(PG(n,q)), q = p(h), p prime, h >= 1, generated by th...
An algorithm for finding wrong symbols in codewords based on using the results of checking for parit...
This repository contains SAT instances and certificates accompanying the paper "A SAT-based Resoluti...
New constructions for moderate-density parity-check (MDPC) codes using finite geometry are proposed....
Projective plane of order 10 does not exist. Proof of this assertion was finished in 1989 and is bas...
We determine the weight enumerator of the code of the projective plane of order 5 by hand. The main ...
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are s...
We study the higher weights of codes formed from planes and biplanes. We relate the higher weights o...
AbstractThere are four known finite projective planes of order 9. This paper reports the result of a...
Let Cn−1(n,q) be the code arising from the incidence of points and hyperplanes in the Desarguesian p...
In the presented work we define a class of error-correcting codes based on incidence vectors of proj...
We show that there are non-desarguesian affine planes of order 16 for which the binary codes have ve...
The minimum weight of the code generated by the incidence matrix of points versus lines in a project...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
In this paper, we study the p-ary linear code C-k (n, q), q = p(h), p prime, h >= 1, generated by th...
In this paper, we study the p-ary linear code C(PG(n,q)), q = p(h), p prime, h >= 1, generated by th...
An algorithm for finding wrong symbols in codewords based on using the results of checking for parit...
This repository contains SAT instances and certificates accompanying the paper "A SAT-based Resoluti...
New constructions for moderate-density parity-check (MDPC) codes using finite geometry are proposed....