The covering radius of spherical designs
From MaRDI portal
Publication:1178026
DOI10.1016/S0195-6698(13)80018-2zbMath0735.05022MaRDI QIDQ1178026
Publication date: 26 June 1992
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the weight distribution of spherical t-designs
- Spherical codes and designs
- Generalization of the Norse bounds to codes of higher strength
- An upper bound on the covering radius as a function of the dual distance
- Asymptotic bounds on the covering radius of binary codes
- An Inversion Formula for Krawtchcuk Polynomials with Applications to Coding Theory
- Covering radius---Survey and recent results
- Nearest neighbor algorithm for spherical codes from the Leech lattice
- On the covering radius of binary codes (Corresp.)
- Covering a sphere with spheres
- Random Packings and Coverings of the Unit n-Sphere