Existence results for generalized balanced tournament designs with block size 3
From MaRDI portal
Publication:1209222
DOI10.1007/BF01389354zbMath0791.05010OpenAlexW2022562302MaRDI QIDQ1209222
Publication date: 16 May 1993
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01389354
Related Items
Constructions for generalized balanced tournament designs ⋮ The existence of doubly resolvable \((v,3,2)\)-BIBDs ⋮ Generalized balanced tournament designs with block size four ⋮ Two series of equitable symbol weight codes meeting the Plotkin bound ⋮ The existence of 3 orthogonal partitioned incomplete Latin squares of type \(t^ n\) ⋮ Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
Cites Work
- The existence of partitioned generalized balanced tournament designs with block size 3
- Existence results for doubly near resolvable \((v,3,2)\)-BIBDs
- On sets of three mols with holes
- Four pairwise orthogonal Latin squares of order 24
- Doubly resolvable designs
- More mutually orthogonal latin squares
- Four mutually orthogonal Latin squares of orders \(28\) and \(52\)
- On near generalized balanced tournament designs
- Constructions for generalized balanced tournament designs
- Balanced tournament designs and related topics
- Finite bases for some PBD-closed sets
- Concerning the number of mutually orthogonal latin squares
- The existence of 3 orthogonal partitioned incomplete Latin squares of type \(t^ n\)
- 3-complementary frames and doubly near resolvable (v,3,2)-BIBDs
- Nonextendibility Conditions on Mutually Orthogonal Latin Squares
- Generalized Balanced Tournament Designs
- On Mutually Orthogonal Resolutions and Near-Resolutions
- The existence of doubly near resolvable (v,3,2)‐BIBDs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item