English

Information Properties of a Random Variable Decomposition through Lattices

Information Theory 2024-05-15 v2 math.IT

Abstract

A full-rank lattice in the Euclidean space is a discrete set formed by all integer linear combinations of a basis. Given a probability distribution on Rn\mathbb{R}^n, two operations can be induced by considering the quotient of the space by such a lattice: wrapping and quantization. For a lattice Λ\Lambda, and a fundamental domain DD which tiles Rn\mathbb{R}^n through Λ\Lambda, the wrapped distribution over the quotient is obtained by summing the density over each coset, while the quantized distribution over the lattice is defined by integrating over each fundamental domain translation. These operations define wrapped and quantized random variables over DD and Λ\Lambda, respectively, which sum up to the original random variable. We investigate information-theoretic properties of this decomposition, such as entropy, mutual information and the Fisher information matrix, and show that it naturally generalizes to the more abstract context of locally compact topological groups.

Keywords

Cite

@article{arxiv.2211.03477,
  title  = {Information Properties of a Random Variable Decomposition through Lattices},
  author = {Fábio C. C. Meneghetti and Henrique K. Miyamoto and Sueli I. R. Costa},
  journal= {arXiv preprint arXiv:2211.03477},
  year   = {2024}
}

Comments

11 pages, 6 figures. v2: improved some explanations in sections 2 and 4, typos, and added citation in section 3

R2 v1 2026-06-28T05:19:09.923Z