Generalized balanced tournament designs and related codes
From MaRDI portal
Publication:1008979
DOI10.1007/S10623-007-9154-6zbMATH Open1179.05018OpenAlexW1988947496MaRDI QIDQ1008979FDOQ1008979
Authors: Jianxing Yin, Jie Yan, Chengmin Wang
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9154-6
Recommendations
- Generalized Balanced Tournament Designs
- Constructions for generalized balanced tournament designs
- The existence of near generalized balanced tournament designs
- Existence results for generalized balanced tournament designs with block size 3
- Near generalized balanced tournament designs with block sizes 4 and 5
Cites Work
- The CRC handbook of combinatorial designs
- On constant composition codes
- Title not available (Why is that?)
- The existence of Room squares
- The existence of Kirkman squares -- doubly resolvable \((v,3,1)\)-BIBDs
- Title not available (Why is that?)
- A construction of optimal constant composition codes
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructions for generalized balanced tournament designs
- Generalized Balanced Tournament Designs
- Frames for Kirkman triple systems
- Combinatorial Constructions of Optimal Constant-Composition Codes
- The PBD-Closure of Constant-Composition Codes
- Construction of Room Squares
- Pairwise balanced designs with consecutive block sizes
Cited In (12)
- Generalized balanced tournament designs with block size four
- Room squares with super-simple property
- Near generalized balanced tournament designs with block sizes 4 and 5
- The existence of near generalized balanced tournament designs
- Constructions for generalized balanced tournament designs
- The existence of \(\mathrm{FrGBTD}(4,g^u)\)s
- A class of optimal constant composition codes from GDRPs
- Optimal ternary constant-composition codes with weight four and distance six
- Two series of equitable symbol weight codes meeting the Plotkin bound
- Generalized Balanced Tournament Designs
- Asymptotic existence of frame-GBTDs
- Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications
This page was built for publication: Generalized balanced tournament designs and related codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008979)