Pages that link to "Item:Q4896843"

The following pages link to Upper bounds on the minimum distance of spherical codes (Q4896843):

Displaying 21 items.

• Cubic and higher degree bounds for codes and \((t,m,s)\)-nets (Q543422) (← links)
• New asymptotic bounds on the size of multiple packings of the Euclidean sphere (Q650105) (← links)
• Universal lower bounds for potential energy of spherical codes (Q730083) (← links)
• The Tietäväinen bound for spherical codes (Q759729) (← links)
• Optimality and uniqueness of the \((4,10,1/6)\) spherical code (Q1003633) (← links)
• Flat tori, lattices and bounds for commutative group codes (Q1009072) (← links)
• On linear programming bounds for codes in polynomial metric spaces (Q1276778) (← links)
• On spherical codes with inner products in a prescribed interval (Q1727345) (← links)
• Some constructions of superimposed codes in Euclidean spaces. (Q1811096) (← links)
• Linear programming bounds for codes in infinite projective spaces (Q1818899) (← links)
• Linear programming bounds for covering radius of spherical designs (Q2038844) (← links)
• Upper bounds for energies of spherical codes of given cardinality and separation (Q2200514) (← links)
• Energy bounds for codes in polynomial metric spaces (Q2318064) (← links)
• Improved Delsarte bounds for spherical codes in small dimensions (Q2642026) (← links)
• On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems (Q2674587) (← links)
• Bounds for the sum of distances of spherical sets of small size (Q2689513) (← links)
• Nearest neighbor algorithm for spherical codes from the Leech lattice (Q3818250) (← links)
• (Q4262989) (← links)
• Bounds for spherical codes: The Levenshtein framework lifted (Q5856745) (← links)
• Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\) (Q5942008) (← links)
• New upper bounds for spherical codes and packings (Q6583556) (← links)