Skip to main content
Log in

On small line sets with few odd-points

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Assmus Jr. E.F., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992).

  2. Balister P., Bollobs B., Fredi Z., Thompson J.: Minimal symmetric differences of lines in projective planes, unpublished, available as arXiv:1303.4117 [math.CO].

  3. Frumkin A., Yakir A.: Rank of inclusion matrices and modular representation theory. Israel J. Math. 71, 309–320 (1990).

    Google Scholar 

  4. Hellerstein L., Gibson G., Karp R., Katz R., Patterson D.: Coding techniques for handling failures in large disk arrays. Algorithmica 12, 18–208 (1994).

    Google Scholar 

  5. Hirschfeld J.W.P.: Finite Projective Spaces of Three Dimensions. Oxford Mathematical Monographs. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York. ISBN: 0-19-853536-8 (1985).

  6. Hirschfeld J.W.P., Storme L.: The packing problem in statistics, coding theory and finite projective spaces: update 2001. In: Blokhuis A., Hirschfeld J.W.P., Jungnickel D., Thas J.A. (eds.), Developments in Mathematics, Finite Geometries, Proceedings of the Fourth Isle of Thorns Conference, Chelwood Gate, July 16–21, 2000, vol. 3, pp. 201–246. Kluwer, Dordrecht (2000).

  7. Müller M., Jimbo M.: Erasure-resilient codes from affine spaces. Discret. Appl. Math. 143, 292–297 (2004).

    Google Scholar 

  8. Segre B.: Ovals in a finite projective plane. Can. J. Math. 7, 414–416 (1955).

    Google Scholar 

Download references

Acknowledgments

The author is supported by a PhD fellowship of the Research Foundation—Flanders (FWO).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Vandendriessche.

Additional information

Communicated by S. Ball.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vandendriessche, P. On small line sets with few odd-points. Des. Codes Cryptogr. 75, 453–463 (2015). https://doi.org/10.1007/s10623-014-9920-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-014-9920-1

Keywords

Mathematics Subject Classification

Navigation