Skip to main content
Log in

Polarities of generalized hexagons and perfect codes

Geometriae Dedicata Aims and scope Submit manuscript

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.

Institutional subscriptions

Bibliography

  1. Biggs, N.: ‘Perfect codes and distance-transitive graphs’, in Combinatorics (Proc. British Combinat. Conf. 1973, ed. T.P. McDonough and V.C. Mavron), 1–8. C.U.P., Cambridge, 1974.

    Google Scholar 

  2. Delsarte, P.: ‘An Algebraic Approach to the Association Schemes of Coding Theory’, Philips Res. Repts. Suppl. 10 (1973).

  3. Payne, S.E.: On the Non-existence of a Class of Configurations which are Nearly Generalized n-gons’, J. Combinatorial Theory 12 (1972), 268–282.

    Google Scholar 

  4. Payne, S.E. and Tinsley, M.F.: ‘On v 1 × v 2(n, s, t) configurations’, J. Combinatorial Theory, 7 (1969), 1–14.

    Google Scholar 

  5. Tits, J.: Private communication.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cameron, P.J., Thas, J.A. & Payne, S.E. Polarities of generalized hexagons and perfect codes. Geom Dedicata 5, 525–528 (1976). https://doi.org/10.1007/BF00150782

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00150782

Keywords

Navigation