The Existence of Near Generalized Balanced Tournament Designs
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.
Keywords
near generalized balanced tournament design; constant composition codes; optimal; existence