Combinatorial Designs with Resolvable Subdesigns Based on Generalized Hadamard matrices

Some series of resolvable rectangular and group divisible designs having resolvable group divisible and L2 subdesigns are identified using generalized Hadamard matrices. Group divisible designs and L2 designs are special classes of rectangular designs.

Authors

Institutions

Publication Details

Journal
Galois Journal of Algebra
Published
2026-06-30
DOI
https://doi.org/10.65908/gja.2026.8390.1022
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Combinatorial Designs with Resolvable Subdesigns Based on Generalized Hadamard matrices

Shyam Saurabh
Galois Journal of Algebra
graph theory and CDMA systems
article

Combinatorial Designs with Resolvable Subdesigns Based on Generalized Hadamard matrices

Shyam Saurabh
article en

Abstract

Some series of resolvable rectangular and group divisible designs having resolvable group divisible and L2 subdesigns are identified using generalized Hadamard matrices. Group divisible designs and L2 designs are special classes of rectangular designs.

Galois Journal of AlgebraVol. 2(2)
Tata Institute of Social Sciences (IN)
Openalex Percentile: Top 12%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Combinatorial Designs with Resolvable Subdesigns Based on Generalized Hadamard matrices — Shyam Saurabh · Galois Journal of Algebra (2026) | TGRS Research Map | TGRS