Bounds on three- and higher-distance sets

Details Bounds on three- and higher-distance sets Bounds on three- and higher-distance sets

2010-05-14

arxiv.org/abs/1005.2639v2

European Journal of Combinatorics 32 (2011) 1182-1190

Mathematics

Combinatorics

12 pages

Scientific paper

A finite set X in a metric space M is called an s-distance set if the set of distances between any two distinct points of X has size s. The main problem for s-distance sets is to determine the maximum cardinality of s-distance sets for fixed s and M. In this paper, we improve the known upper bound for s-distance sets in n-sphere for s=3,4. In particular, we determine the maximum cardinalities of three-distance sets for n=7 and 21. We also give the maximum cardinalities of s-distance sets in the Hamming space and the Johnson space for several s and dimensions.

Affiliated with

Also associated with

No associations

Rating

Bounds on three- and higher-distance sets 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 three- and higher-distance sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on three- and higher-distance sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240794