Information Properties of a Random Variable Decomposition through Lattices

11/07/2022
by   Fábio C. C. Meneghetti, et al.
0

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 ℝ^n, two operations can be induced by considering the quotient of the space by such a lattice: wrapping and quantization. For a lattice Λ, and a fundamental domain D which tiles ℝ^n through Λ, 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 D and Λ, 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2021

Entropy and the Discrete Central Limit Theorem

A strengthened version of the central limit theorem for discrete random ...
research
06/27/2023

An information theoretic necessary condition for perfect reconstruction

This article proposes a new information theoretic necessary condition fo...
research
07/23/2018

Predicting the Integer Decomposition Property via Machine Learning

In this paper we investigate the ability of a neural network to approxim...
research
06/24/2020

Lattice Representation Learning

In this article we introduce theory and algorithms for learning discrete...
research
10/14/2019

Information Decomposition based on Cooperative Game Theory

We offer a new approach to the information decomposition problem in info...
research
03/27/2023

Limits of polyhedral multinomial distributions

We consider limits of certain measures supported on lattice points in la...
research
12/14/2017

Achievability Performance Bounds for Integer-Forcing Source Coding

Integer-forcing source coding has been proposed as a low-complexity meth...

Please sign up or login with your details

Forgot password? Click here to reset