8 research outputs found
LDPC codes associated with linear representations of geometries
We look at low density parity check codes over a finite field K associated with finite geometries T*(2) (K), where K is any subset of PG(2, q), with q = p(h), p not equal char K. This includes the geometry LU(3, q)(D), the generalized quadrangle T*(2)(K) with K a hyperoval, the affine space AG(3, q) and several partial and semi-partial geometries. In some cases the dimension and/or the code words of minimum weight are known. We prove an expression for the dimension and the minimum weight of the code. We classify the code words of minimum weight. We show that the code is generated completely by its words of minimum weight. We end with some practical considerations on the choice of K
On the dual code of points and generators on the Hermitian variety H(2n+1,q²)
We study the dual linear code of points and generators on a non-singular Hermitian variety H(2n + 1, q(2)). We improve the earlier results for n = 2, we solve the minimum distance problem for general n, we classify the n smallest types of code words and we characterize the small weight code words as being a linear combination of these n types
Codes of Desarguesian projective planes of even order, projective triads and (q+t,t)-arcs of type (0,2,t)
AbstractWe study the binary dual codes associated with Desarguesian projective planes PG(2,q), with q=2h, and their links with (q+t,t)-arcs of type (0,2,t), by considering the elements of Fq as binary h-tuples. Using a correspondence between (q+t,t)-arcs of type (0,2,t) and projective triads in PG(2,q), q even, we present an alternative proof of the classification result on projective triads. We construct a new infinite family of (q+t,t)-arcs of type (0,2,t) with t=q4, using a particular form of the primitive polynomial of the field Fq
Moderate-density parity-check codes from projective bundles
New constructions for moderate-density parity-check (MDPC) codes using finite geometry are proposed. We design a parity-check matrix for the main family of binary codes as the concatenation of two matrices: the incidence matrix between points and lines of the Desarguesian projective plane and the incidence matrix between points and ovals of a projective bundle. A projective bundle is a special collection of ovals which pairwise meet in a unique point. We determine the minimum distance and the dimension of these codes, and we show that they have a natural quasi-cyclic structure. We consider alternative constructions based on an incidence matrix of a Desarguesian projective plane and compare their error-correction performance with regards to a modification of Gallager’s bit-flipping decoding algorithm. In this setting, our codes have the best possible error-correction performance after one round of bit-flipping decoding given the parameters of the code’s parity-check matrix