Abstract
Let Cn−1(n,q) be the code arising from the incidence of points and hyperplanes in the Desarguesian projective space PG(n,q). Recently, Polverino and Zullo (J Comb Theory Ser A 158:1–11, 2018) proved that within this code, all non-zero code words of weight at most 2qn−1 are scalar multiples of either the incidence vector of one hyperplane, or the difference of the incidence vectors of two distinct hyperplanes. We prove that all code words of weight at most (4q−O(q√))qn−2 are linear combinations of incidence vectors of hyperplanes through a common (n−3)-space. This extends previous results for large values of q.
| Original language | English |
|---|---|
| Pages (from-to) | 771-788 |
| Number of pages | 19 |
| Journal | Designs, Codes and Cryptography |
| Volume | 88 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Apr 2020 |
Bibliographical note
Publisher Copyright:© 2020, Springer Science+Business Media, LLC, part of Springer Nature.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
Keywords
- Finite Projective Geometry
- Coding Theory
- Small weight codewords
Fingerprint
Dive into the research topics of 'Small weight code words arising from the incidence of points and hyperplanes in PG(n,q)'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver