Bounds on sets with few distances

Details Bounds on sets with few distances Bounds on sets with few distances

2009-05-14

arxiv.org/abs/0905.2423v2

Journal of Combinatorial Theory Ser. A, 118 , no. 4, 2011, pp. 1465-1474,

Mathematics

Combinatorics

11 pages

Scientific paper

10.1016/j.jcta.2011.01.002

We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of subsets; (2) we refine the bound of Delsarte-Goethals-Seidel on the maximum size of spherical sets with few distances; (3) we prove a new bound on codes with few distances in the Hamming space, improving an earlier result of Delsarte. We also find the size of maximal binary codes and maximal constant-weight codes of small length with 2 and 3 distances.

Affiliated with

Also associated with

No associations

Rating

Bounds on sets with few distances does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds on sets with few distances, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on sets with few distances will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523410