English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let Ck(n, q) be the p-ary linear code defined by the incidence matrix ofpoints and k-spaces in PG(n, q), q = p^h, p prime, h >= 1. In this pa- per, weshow 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 nocodewords 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 allcodewords 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 weightcodewords of Cn-1(n, q), a result which was previously only known for generaldimension 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]).

An empty interval in the spectrum of small weight codewords in the code from points and k-spaces of PG(n, q)