A family of group divisible designs with arbitrary block sizes
classification
🧮 math.CO
keywords
blockdesignsdivisiblefamilygddsgrouparbitrarybalanced
read the original abstract
Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known balanced incomplete block design (BIBD).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.