Advertisement

Self-Dual Codes and Self-Dual Designs

  • Patrick Solé
Part of the The IMA Volumes in Mathematics and Its Applications book series (IMA, volume 20)

Abstract

We construct self-orthogonal binary codes from projective 2 - (v, k, λ) designs with a polarity, k odd, and λ even. We give arithmetic conditions on the parameters of the design to obtain self-dual or doubly even self-dual codes. Non existence results in the latter case are obtained from rationality conditions of certain strongly regular graphs.

Keyword

Self-dual codes symmetric designs null polarities symplectic polarities Hadamard designs biplanes strongly regular graphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. F. Assmus, Jr., H. F. Mattson, Jr., Algebraic theory of codes II, AFCRL-71-0013, Final Report, 15 October 1970, Part II.Google Scholar
  2. [2]
    P. Cameron, J. H. van Lint, Graphs, codes, and designs, Cambridge University Press, 1980.zbMATHCrossRefGoogle Scholar
  3. [3]
    M. Hall, Jr., Combinatorial Theory, Wiley, 1986.zbMATHGoogle Scholar
  4. [4]
    R. H. F. Denniston, On biplanes with 56 points, Ars. Combin., 9 (1980), pp. 167–169.MathSciNetzbMATHGoogle Scholar
  5. [5]
    V. Pless, A classification of self-orthogonal codes over GF(2)., Discr. Math., 3 (1972), pp. 209–346.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    P. Dembowski, Finite Geometries, Springer, 1968.zbMATHGoogle Scholar
  7. [7]
    J. W. P. Hirschfeld, Projective Geometries over Finite Fields, Clarendon Press, 1979.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag New York, Inc. 1990

Authors and Affiliations

  • Patrick Solé
    • 1
  1. 1.School of Computer and Information ScienceSyracuse UniversitySyracuseUSA

Personalised recommendations