Every large set of equidistant (0, +1, −1)-vectors forms a sunflower
暂无分享,去创建一个
AbstractA theorem of Deza asserts that ifH1, ...,Hm ares-sets any pair of which intersects in exactlyd elements and ifm ≧s2 −s+2, then theHi form aΔ-system, i.e.
$$\left| {\bigcap\limits_{i = 1}^m {H_i } } \right| = d$$
. In other words, every large equidistant (0, 1)-code of constant weight is trivial. We give a (0, +1, −1) analogue of this theorem.
[1] I. J. Schoenberg,et al. Metric spaces and positive definite functions , 1938 .
[2] Jacobus H. van Lint. A theorem on equidistant codes , 1973, Discret. Math..
[3] Michel Deza. Une propriete extremale des plans projectifs finis dans une classe de codes equidistants , 1973, Discret. Math..
[4] Scott A. Vanstone,et al. Recent results on (,) - designs and related configurations , 1981 .