Paper Info
Title
Generalized balanced tournament designs and related codes
Abstract
A generalized balanced tournament design, or a GBTD(k, m) in short, is a (km, k, k 驴 1)-BIBD defined on a km-set V. Its blocks can be arranged into an m 脳 (km 驴 1) array in such a way that (1) every element of V is contained in exactly one cell of each column, and (2) every element of V is contained in at most k cells of each row. In this paper, we present a new construction for GBTDs and show that a GBTD(4, m) exists for any integer m 驴 5 with at most eight possible exceptions. A link between a GBTD(k, m) and a near constant composition code is also mentioned. The derived code is optimal in the sense of its size.
Year
DOI
Venue
2008
10.1007/s10623-007-9154-6
Des. Codes Cryptography
Keywords
Field
DocType
Generalized balanced tournament designs,Near constant composition codes,Constructions,05B05,94B25
Integer,Discrete mathematics,Combinatorics,Tournament,Mathematics
Journal
Volume
Issue
ISSN
46
2
0925-1022
Citations 
PageRank 
References 
11
0.89
9
Authors
3
Name
Order
Citations
PageRank
Jianxing Yin137330.16
Jie Yan2283.42
Chengmin Wang3448.30