Skip to main content

Part of the book series: Mathematics and Its Applications ((MASS,volume 84))

  • 347 Accesses

Abstract

The present paper contains the complete characterization of all the subschemes of the Hamming scheme H(n, 2). The characterization problem for these subschemes is closely related to the study of the lattice of overgroups of the exponentiation S 2S n in the symmetric group \({S_{{2^n}}}\). For this reason the results of the paper can be used in the study of symmetry in algebraic code s, and in the classification of Boolean functions. Some examples of subschemes having two classes for even n were indicated in [4]. All subschemes of H(n, 2) for n ≤ 16 have been classified by computer. A synopsis of these results on enumeration can be found in [5]. An analysis of them led us to a conjecture that the number of subschemes becomes stable when n is sufficiently large. The validity of this conjecture follows from the list of the subschemes of H(n, 2) presented below.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research Reports Supplement, No. 10, 1973.

    Google Scholar 

  2. I.A. Faradzěv, M.H. KIM, M.E. Muzichuk, Cellular rings and groups of automorphisms of graphs. [In this volume].

    Google Scholar 

  3. I. Schur, Zur Theorie der einfach transitiven Permutationsgruppen, S.-B. Preuss Akad. Wiss., 1933, S. 598–623.

    Google Scholar 

  4. V.A. Ustimenko-Bakumovskii, Strongly regular graphs which are invariant under the group γ m ↑ γ m for m ≥ 3. In: Computation in Algebra and Combinatorics, Kiev, Institute of Cybernetics, 1978, p. 101–113 [In Russian].

    Google Scholar 

  5. V.A. Zaichenko, An algorithmic approach to the synthesis of combinatorial objects and computation in permutation groups based on the method of invariant relations,Ph. D. Thesis, 1981, Moscow, MFTI [In Russian].

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Muzichuk, M.E. (1994). The Subschemes of the Hamming Scheme. In: Faradžev, I.A., Ivanov, A.A., Klin, M.H., Woldar, A.J. (eds) Investigations in Algebraic Theory of Combinatorial Objects. Mathematics and Its Applications, vol 84. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1972-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-1972-8_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4195-1

  • Online ISBN: 978-94-017-1972-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics