Asymptotic existence of frame-GBTDs

Generalized balanced tournament designs(GBTDs) are an equivalent characterization of a class of equitable symbol weight codes. Motivated by the construction of GBTDs, we establish in this paper an asymptotic existence theorem for frame-GBTDs of type gnand block size k via decompositions of edge-colored complete digraphs into prescribed edge-colored subgraphs.