Mathematics – Combinatorics
Scientific paper
2012-01-16
J. Combin. Theory Ser. A 116 (2009), no. 4, 996--1001
Mathematics
Combinatorics
Scientific paper
Let Ck(n, q) be the p-ary linear code defined by the incidence matrix of points and k-spaces in PG(n, q), q = p^h, p prime, h >= 1. In this pa- per, we show that there are no codewords of weight in the open interval ] q^{k+1}-1/q-1, 2q^k[ in Ck(n, q) \ Cn-k(n, q) which implies that there are no codewords with this weight in Ck(n, q) \ Ck(n, q) if k >= n/2. In par- ticular, for the code Cn-1(n, q) of points and hyperplanes of PG(n, q), we exclude all codewords in Cn-1(n, q) with weight in the open interval ] q^n-1/q-1, 2q^n-1[. This latter result implies a sharp bound on the weight of small weight codewords of Cn-1(n, q), a result which was previously only known for general dimension for q prime and q = p2, with p prime, p > 11, and in the case n = 2, for q = p^3, p >= 7 ([4],[5],[7],[8]).
de Voorde Geertrui Van
Lavrauw Michel
Storme Leo
Sziklai Peter
No associations
LandOfFree
An empty interval in the spectrum of small weight codewords in the code from points and k-spaces of PG(n, q) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An empty interval in the spectrum of small weight codewords in the code from points and k-spaces of PG(n, q), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An empty interval in the spectrum of small weight codewords in the code from points and k-spaces of PG(n, q) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-410411