Construction of (n, r)-arcs in P G(2, q)

Innovations in Incidence Geometry

Volumn 1, Issue 1, 2005, Pages 133-141

  Braun, Michael ^a   Kohnert, Axel ^a   Wassermann, Alfred ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

arcs; blocking set; group of automor phisms; incidence matrix; lattice point enumeration; projective plane

Indexed keywords

EID: 29144443181     PISSN: 26407337     EISSN: 26407345     Source Type: Journal    
DOI: 10.2140/iig.2005.1.133     Document Type: Article

References (7)

1. S. Ball, Multiple blocking sets and arcs in finite planes, J. Lond. Math. Soc. 54 (1996), 581–593. [2] A. Betten, A. Kerber, A. Kohnert, R. Laue and A. Wassermann, The discovery of simple 7-designs with automorphism group P ΓL(2, 32), Lect. Notes Comput. Sci. 948 (1995), 131–145. [3] M. Braun, Construction of linear codes with large minimum distance, IEEE Transactions on Information Theory 50 (2004). [4] M. Braun, A. Kohnert and A. Wassermann, Optimal linear codes from matrix groups, Submitted. [5] M. Braun and J. Sarmiento, Parallelisms in projective geometries with a prescribed group of automorphisms, Submitted. [6] M. Braun, A. Kerber and R. Laue, Systematic construction of q-analogs of designs, Des. Codes Cryptogr. 34 (2005), 51–66. [7] R. Daskalov, On the existence and the nonexistence of some (k, r)-arcs in P G(2, 17), in: Proceedings of Ninth International Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgaria, June 19–25 2004 (2004), 95–100. [8] R. Daskalov and M. E. J. Contreras, New (k, r)-arcs in the projective plane of order thirteen, J. Geom. 80 (2004), 10–22. [9] R. Daskalov and E. Metodieva, New (k, r)-arcs in P G(2, 17) and the related optimal linear codes, Mathematica Balkanica, New Series 18 (2004), 121–127.
2. , New (k, r)-arcs in P G(2, 17), in: Proceedings of Ninth International Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgaria, June 19–25 2004 (2004), 107–112.
3. J. W. P. Hirschfeld, Projective Geometries over Finite Fields, Oxford University Press, 1998.
4. J. W. P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces, Update 2001, in: Finite Geometries, Proceedings of the Fourth Isle of Thorns Conference, Chelwood Gate, July 16–21, 2000 (2001), 201–246.
5. A. Kerber, Applied Finite Group Actions, Springer, 1999.
6. E. Kramer and D. Mesner, t-designs on hypergraphs, Discrete Math. 15 (1976), 263–296.
7. A. Wassermann, Finding simple t-designs with enumeration techniques, J. Combin. Des. 6 (1998), 79–90.