Advertisement

Designs, Codes and Cryptography

, Volume 41, Issue 3, pp 319–323 | Cite as

New classes of self-complementary codes and quasi-symmetric designs

  • Carl Bracken
Article

Abstract

We present a new technique for constructing binary error correcting codes and give some examples of codes that can be constructed via this method. Among the examples is an infinite family of self-complementary codes with parameters (2u 2u, 8u 2, u 2u) that can be constructed whenever there exists a u × u Hadamard Matrix. These codes meet the Grey–Rankin bound and imply the existence of quasi-symmetric designs on 2u 2u points.

Keywords

Quasi-symmetric designs Grey Rankin bound Self-complementary codes 

AMS Classification

05E20 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bracken C, McGuire G, Ward HN (2006) New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices. Designs, Codes and Crytography 41Google Scholar
  2. 2.
    Cameron PJ (1973) Near-regularity conditions for designs. Geom Ded 2:213–223MATHMathSciNetGoogle Scholar
  3. 3.
    Hill R (1986) A first course in coding theory. Oxford Applied Mathematics and Computing Science Series, OxfordMATHGoogle Scholar
  4. 4.
    McGuire G (1997) Quasi-symmetric designs and codes meeting the Grey-Rankin bound. J Combin Theory Ser A 72:280–291MathSciNetCrossRefGoogle Scholar
  5. 5.
    MacWilliams FJ, Sloane NJA (1977) The theory of error-correcting codes. North Holland, AmsterdamMATHGoogle Scholar
  6. 6.
    Shrikhande MS, Sane SS (1992) Quasi-symmetric designs. Cambridge University Press, CambridgeMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.School of MathematicsDublin Institute of TechnologyDublin 8Ireland

Personalised recommendations