Combinatorics of Symmetric Designs

Yury J. Ionin; Mohan S. Shrikhande

doi:10.1017/CBO9780511542992

- Get access
  
  Buy a print copy
  
  Check if you have access via personal or institutional login
  
  Log in Register
Cited by 61
Cited by
- 61
Crossref Citations

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Ionin, Yury J. and Shrikhande, Mohan S. 2006. Decomposable symmetric designs. Discrete Mathematics, Vol. 306, Issue. 14, p. 1557.

CrossRef

Google Scholar

Gharge, Sanjeevani and Sane, Sharad 2007. Quasi-affine symmetric designs. Designs, Codes and Cryptography, Vol. 42, Issue. 2, p. 145.

CrossRef

Google Scholar

Bracken, Carl and McGuire, Gary 2007. Duals of quasi-3 designs are not necessarily quasi-3. Designs, Codes and Cryptography, Vol. 44, Issue. 1-3, p. 157.

CrossRef

Google Scholar

Arhin, John 2007. On the structure of 1-designs with at most two block intersection numbers. Designs, Codes and Cryptography, Vol. 43, Issue. 2-3, p. 103.

CrossRef

Google Scholar

Haemers, Willem H. and Xiang, Qing 2008. Strongly Regular Graphs with Parameters (4m^4, 2m^4 + m^2, m^4 + m^2, m^4 + m2) Exist for All m>1. SSRN Electronic Journal,

CrossRef

Google Scholar

Alraqad, Tariq 2008. New families of non‐embeddable quasi‐derived designs. Journal of Combinatorial Designs, Vol. 16, Issue. 4, p. 263.

CrossRef

Google Scholar

Kaski, Petteri and Östergård, Patric R. J. 2008. There are exactly five biplanes with k = 11. Journal of Combinatorial Designs, Vol. 16, Issue. 2, p. 117.

CrossRef

Google Scholar

Alraqad, T. A. and Shrikhande, M. S. 2009. An Overview of Embedding Problems of Quasi-Residual Designs. Journal of Statistical Theory and Practice, Vol. 3, Issue. 2, p. 319.

CrossRef

Google Scholar

Alraqad, Tariq and Shrikhande, Mohan 2009. Infinite families of non‐embeddable quasi‐residual Menon designs. Journal of Combinatorial Designs, Vol. 17, Issue. 1, p. 53.

CrossRef

Google Scholar

Suetake, C. 2009. Automorphism Groups of A Symmetric Transversal Design STD2[12;6]. Journal of Statistical Theory and Practice, Vol. 3, Issue. 2, p. 429.

CrossRef

Google Scholar

Hatono, Teppei Suetake, Chihiro and Szekely, Laszlo A. 2010. On Symmetric Transversal Designs STD8[24; 3]′s. International Journal of Combinatorics, Vol. 2010, Issue. 1,

CrossRef

Google Scholar

Braić, Snježana Golemac, Anka Mandić, Joško and Vučičić, Tanja 2011. Primitive symmetric designs with up to 2500 points. Journal of Combinatorial Designs, Vol. 19, Issue. 6, p. 463.

CrossRef

Google Scholar

Yu Ru Lee Shih Yu Chang and Hsiao-Chun Wu 2011. SHOW: Novel Symmetric Design for a Hybrid Handoff Scheme in Wireless Networks. p. 1.

CrossRef

Google Scholar

OSIFODUNRIN, ADEGOKE S. 2011. ON THE EXISTENCE OF NON-ABELIAN (210, 77, 28), (336, 135, 54) AND (496, 55, 6) DIFFERENCE SETS. Discrete Mathematics, Algorithms and Applications, Vol. 03, Issue. 01, p. 121.

CrossRef

Google Scholar

Alraqad, Tariq and Shrikhande, Mohan 2011. Some results on λ-designs with two block sizes. Journal of Combinatorial Designs, Vol. 19, Issue. 2, p. 95.

CrossRef

Google Scholar

OSIFODUNRIN, ADEGOKE S. 2012. A SIMPLE WAY TO ESTABLISH NON-EXISTENCE OF DIFFERENCE SETS. Discrete Mathematics, Algorithms and Applications, Vol. 04, Issue. 01, p. 1250007.

CrossRef

Google Scholar

Al-Kenani, Ahmad N. 2012. The Code of the Symmetric Net with m = 4 and μ = 2. Open Journal of Discrete Mathematics, Vol. 02, Issue. 01, p. 1.

CrossRef

Google Scholar

Osifodunrin, Adegoke Solomon 2012. On the Existence of (v,k,λ) Difference Sets with k<1250 and k−λ Is a Square. ISRN Algebra, Vol. 2012, Issue. , p. 1.

CrossRef

Google Scholar

Singh Rawat, Ankit Papailiopoulos, Dimitris S. and Dimakis, Alexandros G. 2013. Availability and locality in distributed storage. p. 923.

CrossRef

Google Scholar

OSIFODUNRIN, ADEGOKE S. 2013. ON THE EXISTENCE OF A CLASS OF (v, k, λ) DIFFERENCE SETS WITH k < 350, n = m2, m = 5, 8, 9, 11, 13, 14 AND v ≡ 0 MOD 68. Discrete Mathematics, Algorithms and Applications, Vol. 05, Issue. 03, p. 1350016.

CrossRef

Google Scholar

Download full list

Yury J. Ionin, Central Michigan University, Mohan S. Shrikhande, Central Michigan University

Publisher:: Cambridge University Press
Online publication date:: February 2010
Print publication year:: 2006
Online ISBN:: 9780511542992
DOI:: https://doi.org/10.1017/CBO9780511542992

Subjects:: Mathematics (general), Mathematics, Discrete Mathematics Information Theory and Coding
Series:: New Mathematical Monographs (5)

141.00 (GBP)

Digital access for individuals
(PDF download and/or read online)
Add to cart

Added to cart

Digital access for individuals
(PDF download and/or read online)
View cart
Export citation
Buy a print copy

Information

Contents

Metrics

The aim of this book is to provide a unified exposition of the theory of symmetric designs with emphasis on recent developments. The authors cover the combinatorial aspects of the theory giving particular attention to the construction of symmetric designs and related objects. The last five chapters of the book are devoted to balanced generalized weighing matrices, decomposable symmetric designs, subdesigns of symmetric designs, non-embeddable quasi-residual designs, and Ryser designs. Most results in these chapters have never previously appeared in book form. The book concludes with a comprehensive bibliography of over 400 entries. Researchers in all areas of combinatorial designs, including coding theory and finite geometries, will find much of interest here. Detailed proofs and a large number of exercises make this book suitable as a text for an advanced course in combinatorial designs.

'Most results in these chapters have never appeared in book form. Researchers in all areas of combinational designs, including coding theory and finite geometries, will find much of interest here. Detailed proofs and a large number of exercises make this book suitable as a text for an advance course in combinatorial designs.'

Source: L'enseignement mathematique

Metrics

Total number of HTML views: 0

Total number of PDF views: 0 *

Loading metrics...

Total views: 0 *

Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

Combinatorics of Symmetric Designs

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Book description

Reviews

Refine List

Actions for selected content:

Contents

Frontmatter
pp i-vi

Contents
pp vii-x

Preface
pp xi-xiv

1 - Combinatorics of finite sets
pp 1-13

2 - Introduction to designs
pp 14-58

3 - Vector spaces over finite fields
pp 59-112

4 - Hadamard matrices
pp 113-153

5 - Resolvable designs
pp 154-185

6 - Symmetric designs and t-designs
pp 186-211

7 - Symmetric designs and regular graphs
pp 212-246

8 - Block intersection structure of designs
pp 247-288

9 - Difference sets
pp 289-322

10 - Balanced generalized weighing matrices
pp 323-367

11 - Decomposable symmetric designs
pp 368-406

12 - Subdesigns of symmetric designs
pp 407-428

13 - Non-embeddable quasi-residual designs
pp 429-446

14 - Ryser designs
pp 447-487

Appendix
pp 488-494

References
pp 495-513

Index
pp 514-519

Metrics

Full text views

Book summary page views

Combinatorics of Symmetric Designs

Book description

Reviews

Refine List

Actions for selected content:

Save Search

Contents

Metrics

Full text views

Book summary page views