Generalized balanced tournament designs and related codes
From MaRDI portal
Publication:1008979
DOI10.1007/s10623-007-9154-6zbMath1179.05018OpenAlexW1988947496MaRDI QIDQ1008979
Jianxing Yin, Jie Yan, Cheng Min 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
Related Items (9)
Generalized balanced tournament designs with block size four ⋮ Room squares with super-simple property ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ Two series of equitable symbol weight codes meeting the Plotkin bound ⋮ Asymptotic existence of frame-GBTDs ⋮ A class of optimal constant composition codes from GDRPs ⋮ The existence of \(\mathrm{FrGBTD}(4,g^u)\)s ⋮ Near generalized balanced tournament designs with block sizes 4 and 5 ⋮ Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairwise balanced designs with consecutive block sizes
- A construction of optimal constant composition codes
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- Frames for Kirkman triple systems
- The existence of Room squares
- Constructions for generalized balanced tournament designs
- The existence of Kirkman squares -- doubly resolvable \((v,3,1)\)-BIBDs
- On constant composition codes
- Generalized Balanced Tournament Designs
- Combinatorial Constructions of Optimal Constant-Composition Codes
- The PBD-Closure of Constant-Composition Codes
- Construction of Room Squares
This page was built for publication: Generalized balanced tournament designs and related codes