A lower bound for 0,1,* tournament codes (Q1095111)
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 4027354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for 0,1,* tournament codes |
scientific article; zbMATH DE number 4027354 |
Statements
A lower bound for 0,1,* tournament codes (English)
0 references
1987
0 references
A 0,1,* tournament code is a set of k-sequences from 0,1,* such that of any two words exactly one has a 1 in some place where the other has a zero. They are involved in a bound of Tang for comma-free codes. The authors construct a specific code of length \(m^ 2+m+1\) and size \(m^ 3+m^ 2+m+1\).
0 references
tournament code
0 references
comma-free codes
0 references
0.86069894
0 references
0.8568879
0 references
0.8522711
0 references
0 references
0.85071963
0 references
0.84768665
0 references
0 references
0 references
