Spherical codes and Borsuk's conjecture
DOI10.1016/S0012-365X(01)00202-3zbMATH Open1010.52004OpenAlexW2091497302WikidataQ123218656 ScholiaQ123218656MaRDI QIDQ5957716FDOQ5957716
Authors: Aicke Hinrichs 
Publication date: 15 May 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00202-3
Recommendations
Combinatorial aspects of matroids and geometric lattices (05B35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Cited In (22)
- A kind of higher-dimensional geometric structure and Malan conjecture. III
- Title not available (Why is that?)
- Indexes of spherical codes
- Improved Delsarte bounds for spherical codes in small dimensions
- Title not available (Why is that?)
- Spherically Punctured Biorthogonal Codes
- Title not available (Why is that?)
- Borsuk number for planar convex bodies
- SPT(q, k, n)-Codes
- Title not available (Why is that?)
- Distance Verification for Classical and Quantum LDPC Codes
- On a series of Ramsey-type problems in combinatorial geometry
- Uniqueness of Certain Spherical Codes
- Analogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codes
- Around Borsuk's hypothesis
- The concatenation method for construction of spherical codes in \(n\)-dimensional Euclidean space
- Title not available (Why is that?)
- Diameter-extremal subsets of spheres
- Uniqueness of the \((22,891,1/4)\) spherical code
- Sphere-bound-achieving coset codes and multilevel coset codes
- New sets with large Borsuk numbers
- On Borsuk's conjecture for two-distance sets
This page was built for publication: Spherical codes and Borsuk's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957716)
