Note: No four subsets forming an N
Journal of Combinatorial Theory Series A
Substitute valuations: Generation and structure
Performance Evaluation
New type of coding problem motivated by database theory
Discrete Applied Mathematics
Sets in Zn with distinct sums of pairs
Discrete Applied Mathematics
The Gelfand widths of lp-balls for 0
Journal of Complexity
Sperner type theorems with excluded subposets
Discrete Applied Mathematics
| Hi-index | 754.84 |
LetA(n,2delta,w)denote the maximum number of codewords in any binary code of lengthn, constant weightw, and Hamming distance2deltaSeveral lower bounds forA(n,2delta,w)are given. Forwanddeltafixed,A(n,2delta,w) geq n^{W-delta+l}/w!andA(n,4,w)sim n^{w-l}/w!asn rightarrow infty. In most cases these are better than the "Gilbert bound." Revised tables ofA(n,2 delta,w)are given in the rangen leq 24anddelta leq 5.