The existence of near generalized balanced tournament designs (Q426907)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6045721
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The existence of near generalized balanced tournament designs |
scientific article; zbMATH DE number 6045721 |
Statements
The existence of near generalized balanced tournament designs (English)
0 references
12 June 2012
0 references
Summary: 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.
0 references
near generalized balanced tournament design
0 references
constant composition codes
0 references
optimal
0 references
existence
0 references
0.886479914188385
0 references
0.8845012784004211
0 references
0.879723846912384
0 references
0.8793553709983826
0 references
0.8773743510246277
0 references
