EDBT 2026 Demo / reviewers in the wild / expert
Lins Denaux
dblp:262/0917
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0001-8911-8977ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 1 first-author · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Small weight codewords of projective geometric codes II
Sam Adriaensen, Lins Denaux |
Des. Codes Cryptogr. | 2 |
| 2022 | Constructing saturating sets in projective spaces using subgeometries
Lins Denaux |
Des. Codes Cryptogr. | 1 |
| 2020 | Small weight code words arising from the incidence of points and hyperplanes in PG(n, q)abstractLet 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. Sam Adriaensen, Lins Denaux, Leo Storme, Zsuzsa Weiner |
Des. Codes Cryptogr. | 2 |