Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 4 / 4
First pagePrevious page1Next pageLast page
1.
The minimum weight of the code of intersecting lines in PG(3,q)
Sam Adriaensen, Robin Simoens, Leo Storme, 2026, original scientific article

Abstract: We characterise the minimum weight codewords of the p-ary linear code of intersecting lines in PG(3,q), q = p^h, q ≥ 19, p prime, h ≥ 1. If q is even, the minimum weight equals q³ + q² + q + 1. If q is odd, the minimum weight equals q³ + 2q² + q + 1. For q even, we also characterise the codewords of second smallest weight.
Keywords: linear codes, finite projective spaces, Klein quadric
Published in RUP: 21.12.2025; Views: 160; Downloads: 0
.pdf Full text (423,64 KB)

2.
3.
4.
A note on a geometric construction of large Cayley graps of given degree and diameter
György Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2009, original scientific article

Abstract: An infinite series and some sporadic examples of large Cayley graphs with given degree and diameter are constructed. The graphs arise from arcs, caps and other objects of finite projective spaces.
Keywords: degree, diameter problem, Moore bound, finite projective spaces
Published in RUP: 15.10.2013; Views: 18604; Downloads: 81
URL Link to full text

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica