Journal of Combinatorial Designs

Aims & Scope

The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory.

All topics in design theory, and in which design theory has important applications, are covered, including: block designs, t-designs, pairwise balanced designs and group divisible designs Latin squares, quasigroups, and related algebras computational methods in design theory construction methods applications in computer science, experimental design theory, and coding theory graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics finite geometry and its relation with design theory. algebraic aspects of design theory.

Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications.

All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.

View Aims & Scope

---

Metrics & Ranking

Journal Rank

Year	Value
2024	10143

Journal Citation Indicator

Year	Value
2024	907

SJR (SCImago Journal Rank)

Year	Value
2024	0.573

Quartile

Year	Value
2024	Q2

h-index

Year	Value
2024	37

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Cycle decompositions III: Complete graphs and fixed length cycles

  Citation: 146

  Authors: Mateja

• Quantum twisted codes

  Citation: 115

  Authors: J�rgen, Yves

• Covering arrays and intersecting codes

  Citation: 115

  Authors: N. J. A.

• Complete enumeration of pure‐level and mixed‐level orthogonal arrays

  Citation: 101

  Authors: Eric D., Pieter T., Man V. M.

• Small latin squares, quasigroups, and loops

  Citation: 97

  Authors: Brendan D., Alison, Wendy

• On the state of strength‐three covering arrays

  Citation: 96

  Authors: M., D. L.

• A Hadamard matrix of order 428

  Citation: 95

  Authors: H., B.

• Products of mixed covering arrays of strength two

  Citation: 91

  Authors: Charles J., Sosina S., Gary L., Dennis, George B., Joseph L.

• Recursive constructions for difference matrices and relative difference families

  Citation: 87

  Authors: Marco

• Generating uniformly distributed random latin squares

  Citation: 79

  Authors: Mark T., Peter

---