Explicit dimension-dependent upper bounds on logarithmic codebook size for high-dimensional signal compression are obtained by refining Landau's lattice point estimates via uniform Bessel bounds and Abel summation.
Upper bound on √xJν(x) and its applications
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
High-Dimensional Signal Compression: Lattice Point Bounds and Metric Entropy
Explicit dimension-dependent upper bounds on logarithmic codebook size for high-dimensional signal compression are obtained by refining Landau's lattice point estimates via uniform Bessel bounds and Abel summation.