Number of nearest neighbors in a Euclidean code

DOI10.1109/18.333884MaRDI QIDQ4324142zbMATH OpenOpenAlexFDO

Authors Kenneth Zeger, Allen Gersho

Publication date 1 March 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b640c47f1cdd40ff516102c6a886d56aceec30c5

zbMATH Keywords

Euclidean codekissing numbertouching numberupper boundvector quantizerVoronoi cell

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• New packings on a finite-dimensional Euclidean sphere
• On spherical codes generating the kissing number in dimensions 8 and 24
• On kissing numbers and spherical codes in high dimensions
• On a finite matrix group and codes over a Euclidean sphere
• Codes on Euclidean spheres

Cited in

(3)

• Lattices with exponentially large kissing numbers
• A law of large numbers for nearest neighbour statistics
• Stein's method and Poisson process approximation for a class of Wasserstein metrics

This page was built for publication: Number of nearest neighbors in a Euclidean code

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