Skip to main content
SpringerLink
Log in

Association Schemes Related to Kasami Codes and Kerdock Sets

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

Abstract

Two new infinite series of imprimitive 5-class association schemes are constructed. The first series of schemes arises from forming, in a special manner, two edge-disjoint copies of the coset graph of a binary Kasami code (double error-correcting BCH code). The second series of schemes is formally dual to the first. The construction applies vector space duality to obtain a fission scheme of a subscheme of the Cameron-Seidel 3-class scheme of linked symmetric designs derived from Kerdock sets and quadratic forms over GF(2).

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-regular graphs, Springer-Verlag (1989).

  2. D. de Caen, R. Mathon and G. E. Moorhouse, A family of antipodal distance-regular graphs related to the classical Preparata codes, Journal of Algebraic Combinatorics, Vol. 4 (1995) pp. 317-327.

    Google Scholar 

  3. A. R. Calderbank and J.-M. Goethals, Three-weight codes and association schemes, Philips Journal of Research, Vol. 39 (1984) pp. 143-152.

    Google Scholar 

  4. P. J. Cameron and J. J. Seidel, Quadratic forms over G F (2), Proc. Koninkl. Nederl. Akademie van Wetenschappen, Series A, Vol. 76 Indag. Math., Vol. 35 (1973) pp. 1-8.

    Google Scholar 

  5. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research Reports Suppl., Vol. 10 (1973) 97 pages.

  6. C. D. Godsil, Equitable partitions, Combinatorics, Paul Erdös is Eighty, Volume 1, János Bolyai Math. Soc., Budapest (1993) pp. 173-192.

    Google Scholar 

  7. C. D. Godsil and W. J. Martin, Quotients of association schemes, Journal of Combinatorial Theory A, Vol. 69 (1995) pp. 185-199.

    Google Scholar 

  8. W. M. Kantor, Orthogonal spreads and translation planes, Advanced Studies in Pure Mathematics, Vol. 24, Progress in Algebraic Combinatorics, Math. Soc. Japan, Tokyo (1996) pp. 227-242.

    Google Scholar 

  9. A. M. Kerdock, A class of low-rate nonlinear binary codes, Information and Control, Vol. 20 (1972) pp. 182-187.

    Google Scholar 

  10. J. H. van Lint, Introduction to Coding Theory, Springer-Verlag (1982).

  11. J. H. van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge Univ. Press (1992).

  12. R. Mathon and A. Penfold Street, Overlarge sets and partial geometries, Journal of Geometry, Vol. 60 (1997) pp. 85-104.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Queen's University, Kingston, Ontario, K7L 3N6, Canada

    D. de Caen & E. R. van Dam

Authors
  1. D. de Caen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. R. van Dam
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Caen, D.d., Dam, E.R.v. Association Schemes Related to Kasami Codes and Kerdock Sets. Designs, Codes and Cryptography 18, 89–102 (1999). https://doi.org/10.1023/A:1008385102731

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008385102731

Search

Navigation