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...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.展开更多
基金supported by National Natural Science Foundation of China(Grant Nos.11271280 and 11201328)Graduate Student Research and Innovation Program of Jiangsu Province(Grant No.CXZZ13 0794)
文摘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.
