Small Weight Code Words of Projective Geometric Codes

Abstract: We investigate small weight code words of the

p

-ary linear code

m a t h c a l C_{j, k} (n, q)

generated by the incidence matrix of

k

-spaces and

j

-spaces of PG

(n, q)

and its dual, with

q

a prime power and

0 l e q j < k < n

. Firstly, we prove that all code words of

m a t h c a l C_{j, k} (n, q)

up to weight

l e f t (3 - m a t h c a l O l e f t (f r a c 1 q i g h t) i g h t) g e n f r a c [] 0 p t k + 1 {j + 1}_{q}

are linear combinations of at most two

k

-spaces (i.e. two rows of the incidence matrix). As for the dual code

m a t h c a l C_{j, k} (n, q)^{p} e r p

, we manage to reduce both problems of determining its minimum weight (1) and characterising its minimum weight code words (2) to the case

m a t h c a l C_{0, 1} (n, q)^{p} e r p

. This implies the solution to both problem (1) and (2) if

q

is prime and the solution to problem (1) if

q

is even.

This page was built for publication: Small Weight Code Words of Projective Geometric Codes