Uniqueness of Certain Spherical Codes

DOI10.4153/CJM-1981-038-7MaRDI QIDQ4198781zbMATH OpenFDO

Authors Eiichi Bannai, N. J. A. Sloane

Publication date 1981

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1981-038-7

zbMATH Keywords

nonoverlapping unit spheresspherical codestight spherical \(t\)-designsuniqueness

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial codes (94B25)

Recommendations

• Uniqueness of the \((22,891,1/4)\) spherical code
• scientific article; zbMATH DE number 800361
• Nonexistence of certain symmetric spherical codes
• Rigidity of spherical codes
• Spherical codes and Borsuk's conjecture
• Finding and investigating exact spherical codes
• Uniqueness of certain completely regular Hadamard codes
• Optimality and uniqueness of the \((4,10,1/6)\) spherical code
• Publication:4865450
• Asymptotic bounds for spherical codes

Cited in

(26)

• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• On lattices whose minimal vectors form a 6-design
• A survey on spherical designs and algebraic combinatorics on spheres
• \(t\)-designs with general angle set
• More on the uniqueness of the Golay codes
• Nonexistence of certain pseudogeometric graphs
• Half of an antipodal spherical design
• On the spectrum of Markov operators of spherical designs
• Uniqueness of codes using semidefinite programming
• Perfect state transfer on distance-regular graphs and association schemes
• Uniqueness of the \((22,891,1/4)\) spherical code
• Sphere packings revisited
• scientific article; zbMATH DE number 1189052 (Why is no real title available?)
• A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
• Exact Semidefinite Programming Bounds for Packing Problems
• Majorization and minimal energy on spheres
• Spherical designs and modular forms of the \(D_4\) lattice
• Stability of optimal spherical codes
• Semidefinite programming bounds for spherical three-distance sets
• Decompositions of powers of quadrics
• Universal minima of discrete potentials for sharp spherical codes
• On generalized kissing numbers of convex bodies
• Towards a proof of the 24-cell conjecture
• Universal optimality of T-avoiding spherical codes and designs
• Spherical designs for finite quaternionic unit groups and their applications to modular forms
• Uniqueness of certain association schemes

This page was built for publication: Uniqueness of Certain Spherical Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198781)