In this paper, we complete the existence of near generalized balanced tournament designs (NGBTDs) with block size 3 and 5. As an application, we obtain new classes of optimal constant composition codes.
@article{10_37236_2288,
author = {Chengmin Wang and Jie Yan},
title = {The existence of near generalized balanced tournament designs},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {2},
doi = {10.37236/2288},
zbl = {1243.05046},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2288/}
}
TY - JOUR
AU - Chengmin Wang
AU - Jie Yan
TI - The existence of near generalized balanced tournament designs
JO - The electronic journal of combinatorics
PY - 2012
VL - 19
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/2288/
DO - 10.37236/2288
ID - 10_37236_2288
ER -
%0 Journal Article
%A Chengmin Wang
%A Jie Yan
%T The existence of near generalized balanced tournament designs
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2288/
%R 10.37236/2288
%F 10_37236_2288
Chengmin Wang; Jie Yan. The existence of near generalized balanced tournament designs. The electronic journal of combinatorics, Tome 19 (2012) no. 2. doi: 10.37236/2288