论文信息 - On k-wise set-intersections and k-wise Hamming-distances

On k-wise set-intersections and k-wise Hamming-distances

We prove a version of the Ray-Chaudhuri?Wilson and Frankl?Wilson theorems for k-wise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a1, a2,?,ak of length n have k-wise Hamming-distance ?, if there are exactly ? such coordinates, where not all of their coordinates coincide (alternatively, exactly n?? of their coordinates are the same). We show a Delsarte-like upper bound: codes with few k-wise Hamming-distances must contain few code-words.

Benny Sudakov | Vince Grolmusz

[1] Noga Alon,et al. Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems , 1991, J. Comb. Theory, Ser. A.

[2] Peter Frankl,et al. Intersection theorems with geometric consequences , 1981, Comb..

[3] P. Frankl,et al. Linear Algebra Methods in Combinatorics I , 1988 .

[4] P. Delsarte,et al. The Association Schemes of Coding Theory , 1975 .

[5] G. Vince,et al. Set-Systems with Restricted Multiple Intersections and Explicit Ramsey Hypergraphs , 2001 .

[6] Zoltán Füredi,et al. Extremal set systems with restricted k-wise intersections , 2004, J. Comb. Theory, Ser. A.

[7] Zoltán Füredi,et al. On finite set-systems whose every intersection is a Kernel of a star , 1983, Discret. Math..

[8] Van H. Vu,et al. Extremal Set Systems with Weakly Restricted Intersections , 1999, Comb..

[9] Richard M. Wilson,et al. On $t$-designs , 1975 .

[10] Aart Blokhuis. A New Upper Bound for The Cardinality of 2-Distance Sets in Euclidean Space , 1981 .

[11] László Babai. A New Proof of Several Inequalities on Codes and Sets , 1995, J. Comb. Theory, Ser. A.

[12] Y. Marignac,et al. Note , 1951, Neurochemistry International.

[13] Peter Frankl,et al. Orthogonal vectors in then-dimensional cube and codes with missing distances , 1986, Comb..

[14] N. Singh,et al. On Functions of Strength T , 1983 .