By Topic

Upper bounds on the minimum distance of spherical codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
P. G. Boyvalenkov ; Inst. of Math., Bulgarian Acad. of Sci., Sofia, Bulgaria ; D. P. Danev ; S. P. Bumova

We use linear programming techniques to obtain new upper bounds on the maximal squared minimum distance of spherical codes with fixed cardinality. Functions Qj(n,s) are introduced with the property that Qj(n,s)<0 for some j>m if and only if the Levenshtein bound Lm(n,s) on A(n,s)=max{|W|:W is an (n,|W|,s) code} can be improved by a polynomial of degree at least m+1. General conditions on the existence of new bounds are presented. We prove that for fixed dimension n⩾5 there exists a constant k=k(n) such that all Levenshtein bounds Lm(n, s) for m⩾2k-1 can be improved. An algorithm for obtaining new bounds is proposed and discussed

Published in:

IEEE Transactions on Information Theory  (Volume:42 ,  Issue: 5 )