The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding
Author:
- Or OrdentlichOOOr Ordentlich
Preprint
Abstract
For a lattice/linear code, we define the Voronoi spherical cumulative density function (CDF) as the CDF of the $\ell_2$-norm/Hamming weight of a random vector uniformly distributed over the Voronoi cell. Using the first moment method together with a simple application of Jensen's inequality, we develop lower bounds on the expected Voronoi spherical CDF of a random lattice/linear code. Our bounds are quite close to a trivial ball-based lower bound and immediately translate to improved upper bounds on the normalized second moment and the error probability of a random lattice over the additive white Gaussian noise channel, as well as improved upper bounds on the Hamming distortion and the error probability of a random linear code over the binary symmetric channel.Keywords
All Related Versions
This publication has 44 references indexed in Scilit:
- Bounds on the density of smooth lattice coveringsJournal d'Analyse Mathématique, 2025
- New bounds on the density of lattice coveringsJournal of the American Mathematical Society, 2021
- Lattice Coding for Signals and Networks2014
- On lattice quantization noiseIEEE Transactions on Information Theory, 1996
- Bounds on the decoding error probability of binary linear codes via their spectraIEEE Transactions on Information Theory, 1994
- On coding without restrictions for the AWGN channelIEEE Transactions on Information Theory, 1994
- Coset codes. I. Introduction and geometrical classificationIEEE Transactions on Information Theory, 1988
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Information Theory and Reliable Communication1972
- The Leech lattice as a code for the Gaussian channelInformation and Control, 1971