An Information Theoretic Condition for Perfect Reconstruction - Département Communications et Electronique Access content directly
Journal Articles Entropy Year : 2024

An Information Theoretic Condition for Perfect Reconstruction

Abstract

A new information theoretic condition is presented for reconstructing a discrete random variable X based on the knowledge of a set of discrete functions of X. The reconstruction condition is derived from Shannon’s 1953 lattice theory with two entropic metrics of Shannon and Rajski. Because such a theoretical material is relatively unknown and appears quite dispersed in different references, we first provide a synthetic description (with complete proofs) of its concepts, such as total, common, and complementary information. The definitions and properties of the two entropic metrics are also fully detailed and shown to be compatible with the lattice structure. A new geometric interpretation of such a lattice structure is then investigated, which leads to a necessary (and sometimes sufficient) condition for reconstructing the discrete random variable X given a set {X1,…,Xn} of elements in the lattice generated by X. Intuitively, the components X1,…,Xn of the original source of information X should not be globally “too far away” from X in the entropic distance in order that X is reconstructable. In other words, these components should not overall have too low of a dependence on X; otherwise, reconstruction is impossible. These geometric considerations constitute a starting point for a possible novel “perfect reconstruction theory”, which needs to be further investigated and improved along these lines. Finally, this condition is illustrated in five specific examples of perfect reconstruction problems: the reconstruction of a symmetric random variable from the knowledge of its sign and absolute value, the reconstruction of a word from a set of linear combinations, the reconstruction of an integer from its prime signature (fundamental theorem of arithmetic) and from its remainders modulo a set of coprime integers (Chinese remainder theorem), and the reconstruction of the sorting permutation of a list from a minimal set of pairwise comparisons.
Fichier principal
Vignette du fichier
202312delsolrioulbeguinotrabietsouloumiac.pdf (596.01 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-04416099 , version 1 (25-01-2024)

Identifiers

Cite

Idris Delsol, Olivier Rioul, Julien Béguinot, Victor Rabiet, Antoine Souloumiac. An Information Theoretic Condition for Perfect Reconstruction. Entropy, 2024, 26 (1), pp.86. ⟨10.3390/e26010086⟩. ⟨hal-04416099⟩
63 View
5 Download

Altmetric

Share

Gmail Facebook X LinkedIn More