Skip to main content
main-content
Top

Hint

Swipe to navigate through the articles of this issue

01-06-2015 | Issue 3/2015

Designs, Codes and Cryptography 3/2015

On small line sets with few odd-points

Journal:
Designs, Codes and Cryptography > Issue 3/2015
Author:
Peter Vandendriessche
Important notes
Communicated by S. Ball.

Abstract

In this paper, we study small sets of lines in \({{\mathrm{PG}}}(n,q)\) and \({{\mathrm{AG}}}(n,q),\,q\) odd, that have a small number of odd-points. We fix a small glitch in the proof of an earlier bound in the affine case, we extend the theorem to the projective case, and we attempt to classify all the sets where equality is reached. For the projective case, we obtain a full classification. For the affine case, we obtain a full classification minus one open case where there is only a characterization.

Please log in to get access to this content

Literature
About this article

Other articles of this Issue 3/2015

Designs, Codes and Cryptography 3/2015 Go to the issue

Premium Partner

    Image Credits