Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

In this paper, we study the codes arising from the incidence of points and-spaces in over the
field, with, prime. We classify all codewords of minimum weight of the dual code in case. This …

We investigate small weight codewords of the p-ary linear code C j, k (n, q) generated by the
incidence matrix of k-spaces and j-spaces of PG (n, q) and its dual, with qa prime power and …

After completing my master's degree with a thesis on codes arising from the incidence
matrices of finite projective spaces and their substructures, I started in October 2010 as a …

We characterise the minimum weight codewords of the $ p $-ary linear code of intersecting
lines in ${\rm PG}(3, q) $, $ q= p^ h $, $ q\geq19 $, $ p $ prime, $ h\geq 1$. If $ q $ is even …

In this paper, we tie together two well studied topics related to finite Desarguesian affine and
projective planes. The first topic concerns directions determined by a set, or even a multiset …

Over the past few years, the codes $\mathcal {C} _ {n-1}(n, q) $ arising from the incidence of
points and hyperplanes in the projective space $\text {PG}(n, q) $ attracted a lot of attention …

In this paper we completely characterize the words with second minimum weight in the p-ary
linear code generated by the rows of the incidence matrix of points and hyperplanes of PG …

Characterising and constructing codes using finite geometries Page 1 Characterising and
constructing codes using finite geometries Dissertation submitted in partial fulfilment of the …

Kakeya sets in the affine plane\mathrm AG (2, q) are point sets that are the union of lines,
one through every point on the line at infinity. The finite field Kakeya problem asks for the …