Skip to main content

Part of the book series: Algorithms and Computation in Mathematics ((AACIM,volume 15))

  • 1395 Accesses

Abstract

In this chapter we turn to the first main topic of this book, classification of designs. The designs to be discussed are divided into three classes: balanced incomplete block designs (BIBDs) – that is, 2-designs – are considered in Sect. 6.1, t-designs with t ≥ 3 in Sect. 6.2, and resolutions of designs in Sect. 6.3. In the discussion of resolutions of designs, the main focus is on resolutions of BIBDs. Extensive tables of classification results are provided at the end of each section. Finally, in Sect. 6.4, classification of designs with certain additional properties is briefly discussed.

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 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this chapter

Cite this chapter

Kaski, P., Östergård, P.R. (2006). Classification of Designs. In: Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28991-7_6

Download citation

Publish with us

Policies and ethics