The Existence of Near Generalized Balanced Tournament Designs

  • Chengmin Wang
  • Jie Yan
DOI: https://doi.org/10.37236/2288
Keywords: near generalized balanced tournament design, constant composition codes, optimal, existence

Abstract

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.

Published
2012-06-06
How to Cite
Wang, C., & Yan, J. (2012). The Existence of Near Generalized Balanced Tournament Designs. The Electronic Journal of Combinatorics, 19(2), P28. https://doi.org/10.37236/2288
Issue
Volume 19, Issue 2 (2012)
Article Number
P28