Skip to main content
SpringerLink
Log in

The Association Schemes of Coding Theory

  • Conference paper
Combinatorics

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 16))

Abstract

This paper contains the bases of an algebraic theory of certain association schemes, called polynomial schemes. Special emphasis is put on concepts arising from the theories of error correcting codes and of combinatorial designs. The main goal is to provide a general framework in which various applications can be treated by similar methods. In this respect, an interesting formal duality is exhibited between non-constructive coding and design theory.

The author’s participation in this meeting was not supported by NATO.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biggs, N.L., Perfect codes in graphs, J. Combinatorial Theory B, 15 (1973) 289–296.

    Article  MathSciNet  MATH  Google Scholar 

  2. Bose, R.C., Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math., 13 (1963) 389–419.

    MathSciNet  MATH  Google Scholar 

  3. Bose, R.C. & D.M. Mesner, On linear associative algebras corresponding to association schemes of partially balanced designs, Ann. Math. Statist., 30 (1959) 21–38.

    Article  MathSciNet  MATH  Google Scholar 

  4. Bose R.C. & T. Shimamoto, Classification and analysis of partially balanced incomplete block designs with two associate classes, J. Amer. Statist. Assoc., 47 (1952) 151–184.

    Article  MathSciNet  MATH  Google Scholar 

  5. Cameron, P.J., Near-regularity conditions for designs, Geometriae Dedicata (to appear).

    Google Scholar 

  6. Delsarte, P., Weights of linear codes and strongly regular normed spaces, Discrete Math., 3 (1972) 47–64.

    Article  MathSciNet  MATH  Google Scholar 

  7. Delsarte, P., Four fundamental parameters of a code and their combinatorial significance, Information and Control, 23 (1973) 407–438.

    Article  MathSciNet  MATH  Google Scholar 

  8. Delsarte, P., An algebraic approach to the association schemes of coding theory, Philips Res. Repts. Suppl., 10 (1973).

    Google Scholar 

  9. Doob, M., On graph products and association schemes, Utilitas Math., 1 (1972) 291–302.

    MathSciNet  MATH  Google Scholar 

  10. Goethals, J.M. & J.J. Seidel, Strongly regular graphs derived from combinatorial designs, Canad. J. Math., 22 (1970) 597–614.

    Article  MathSciNet  MATH  Google Scholar 

  11. Goethals, J.M. & S.L. Snover, Nearly perfect binary codes, Discrete Math., 3 (1972) 65–88.

    Article  MathSciNet  MATH  Google Scholar 

  12. Hanani, H., The existence and construction of balanced imcomplete block designs, Ann. Math. Statist., 32 (1961) 361–386.

    Article  MathSciNet  MATH  Google Scholar 

  13. Higman, D.G., Combinatorial considerations about permutation groups, Lecture Notes, Mathematical Institute, Oxford, 1972.

    Google Scholar 

  14. Hughes, D.R., Combinatorial analysis, t-designs and permutation groups, Amer. Math. Soc., Proc. Symp. Pure Math., 6 (1962) 39–41.

    Google Scholar 

  15. Johnson, S.M., A new upper bound for error-correcting codes, IEEE Trans. Information Theory, IT-8 (1962) 203–207.

    Article  MATH  Google Scholar 

  16. Krawtchouk, M., Sur une generalisation des polynômes d’Hermite, Comptes Rendus de L’Académie des Sciences, Paris, 189 (1929) 620–622.

    MATH  Google Scholar 

  17. Lenstra, Jr., H.W., Two theorems on perfect codes, Discrete Math., 3 (1972) 125–132.

    Article  MathSciNet  MATH  Google Scholar 

  18. Lint, J.H. Van, A survey of perfect codes, Rocky Mountain J. Math, (to appear).

    Google Scholar 

  19. Macwilliams, F.J., Doctoral Dissertation, Harvard University, 1961 (unpublished).

    Google Scholar 

  20. MacWilliams, F.J., A theorem on the distribution of weights in a systematic code, Bell Syst. Tech. J., 42 (1963) 79–94.

    MathSciNet  Google Scholar 

  21. Ogasawara, M., A necessary condition for the existence of regular and symmetrical PBIB designs of Tm type, Inst. Statist. mimeo series 418, Chapel Hill, N.C., 1965.

    Google Scholar 

  22. Ogawa, J., The theory of the association algebra and the relationship algebra of a partially balanced incomplete block design, Inst. Statist. mimeo series 224, Chapel Hill, N.C., 1959.

    Google Scholar 

  23. Rao, C.R., Factorial experiments derivable from combinatorial arrangements of arrays, J. Roy. Statist. Soc., 9 (1947) 128–139.

    Google Scholar 

  24. Semakov, N.V., V.A. Zinov’ev & G.V. Zaitzev, Uniformly packed codes, Problemy Peredači Informacii, 7 (1971) 38–50, (in Russian).

    MATH  Google Scholar 

  25. Tamaschke, O., Zur Theorie der Permutationsgruppen mit regulärer Untergruppe, I and II, Math. z., 80 (1963) 328–352

    Article  MathSciNet  MATH  Google Scholar 

  26. Tamaschke, O., Zur Theorie der Permutationsgruppen mit regulärer Untergruppe, I and II, Math. z., 80 (1963) 443–465.

    Article  MathSciNet  MATH  Google Scholar 

  27. Wilson, K.M., Lectures on t-designs, Ohio State University, 1971, communicated by J. Doyen.

    Google Scholar 

  28. Wilson, R.M. & O.K. Ray-Chaudhuri, Generalization of Fisher’s inequality to t-designs, Amer. Math. Soc. Notices, 18 (1971) 805.

    Google Scholar 

  29. Yamamoto, S., Y. Fujii & N. Hamada, Composition of some series of association algebras, J. Sci. Hiroshima Univ., (A-I) 29 (1965) 181–215.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MBLE Research Laboratory, Brussels, Belgium

    P. Delsarte

Authors
  1. P. Delsarte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Hall Jr. J. H. van Lint

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Mathematical Centre, Amsterdam

About this paper

Cite this paper

Delsarte, P. (1975). The Association Schemes of Coding Theory. In: Hall, M., van Lint, J.H. (eds) Combinatorics. NATO Advanced Study Institutes Series, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-1826-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-1826-5_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-1828-9

  • Online ISBN: 978-94-010-1826-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation