Number of nearest neighbors in a Euclidean code

DOI10.1109/18.333884zbMath0813.94025OpenAlexW2124140026MaRDI QIDQ4324142

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

upper boundVoronoi cellkissing numbertouching numbervector quantizerEuclidean code

Mathematics Subject Classification ID

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

Related Items (2)

Stein's method and Poisson process approximation for a class of Wasserstein metrics ⋮ A law of large numbers for nearest neighbour statistics

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