A pair of disjoint 3-gdds of type g^t u^1
From MaRDI portal
Publication:540473
Abstract: Pairwise disjoint 3-GDDs can be used to construct some optimal constant-weight codes. We study the existence of a pair of disjoint 3-GDDs of type and establish that its necessary conditions are also sufficient.
Recommendations
- Constant weight codes and group divisible designs
- scientific article; zbMATH DE number 2057991
- Generalized steiner triple systems with group size five
- Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
- 4‐*GDDs(3n) and generalized Steiner systems GS(2, 4, v, 3)
Cites work
- A new class of group divisible designs with block size three
- Completely reducible super-simple designs with block size four and related super-simple packings
- Constructions for q-Ary Constant-Weight Codes
- Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
- scientific article; zbMATH DE number 4150168 (Why is no real title available?)
- scientific article; zbMATH DE number 4006279 (Why is no real title available?)
- scientific article; zbMATH DE number 3788634 (Why is no real title available?)
- scientific article; zbMATH DE number 165087 (Why is no real title available?)
- scientific article; zbMATH DE number 3487460 (Why is no real title available?)
- On 1-factorizability of Cayley graphs
- Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six
- Resolvable group divisible designs with block size 3
- Steiner Triple Systems Having a Prescribed Number of Triples in Common
- The number of repeated blocks in twofold triple systems
- Uniformly resolvable pairwise balanced designs with blocksizes two and three
Cited in
(3)
This page was built for publication: A pair of disjoint 3-gdds of type \(g^{t} u^{1}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540473)