A family of group divisible designs with arbitrary block sizes

DOI10.11650/TJM/190104MaRDI QIDQ2279385zbMATH OpenOpenAlexFDO

Authors Yaotsu Chang, Chong-Dao Lee, Yu-Pei Huang, Chia-An Liu

Publication date 12 December 2019

Published in Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1712.02155, https://projecteuclid.org/euclid.twjm/1548234028

zbMATH Keywords

balanced incomplete block designBIBDbinary fieldGDDgroup divisible design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Theory of error-correcting codes and error-detecting codes (94B99)

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).

Review text

In this paper, the authors are interested in a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes. The paper can be seen as a continuation of the work started in [\textit{C.-D. Lee} et al., Des. Codes Cryptography 86, No. 6, 1281--1293 (2018; Zbl 1387.05024)]. In this research, the authors gave a construction of GDDs by assuming the sum of each error pattern to be any prescribed nonzero element \(\alpha\) instead of 1, and omitting the constraints for the sum of a proper subset \(S\) of \(x_1, \dots,x_k\). The obtained GDDs are similar to the ones constructed in [loc. cit.], for \(k=3,4\), but are different for \(k\geq 5\).

Recommendations

• A construction of group divisible designs with block sizes 3 to 7
• scientific article; zbMATH DE number 1248186
• scientific article; zbMATH DE number 5064057
• Group divisible designs with large block sizes
• scientific article; zbMATH DE number 786152

Cites work

• A construction of group divisible designs with block sizes 3 to 7
• Combinatorial Designs
• Design theory
• Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
• Group divisible designs with large block sizes
• Group divisible designs with two associate classes: n=2 or m=2
• scientific article; zbMATH DE number 45817 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1248186 (Why is no real title available?)
• More results on the existence of simple BIBDs with number of elements a prime power
• New 5-designs
• Odd and even group divisible designs with two groups and block size four
• On the existence of simple BIBDs with number of elements a prime power
• On the Weight Distributions of Cosets of a Linear Code
• Perfect binary codes: constructions, properties, and enumeration
• Symmetry codes over GF(3) and new five-designs
• The CRC handbook of combinatorial designs

Cited in

(5)

• A construction of group divisible designs with block sizes 3 to 7
• Quadratic residue codes, rank three groups and PBIBDs
• scientific article; zbMATH DE number 1802661 (Why is no real title available?)
• scientific article; zbMATH DE number 720682 (Why is no real title available?)
• scientific article; zbMATH DE number 3305114 (Why is no real title available?)

This page was built for publication: A family of group divisible designs with arbitrary block sizes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279385)