An Information Theoretic Condition for Perfect Reconstruction
Open Access
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 of elements in the lattice generated by X. Intuitively, the components 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.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Algebraic foundations for quantitative information flowMathematical Structures in Computer Science, 2014
- An Information Theory Analysis of Visual Complexity and DissimilarityPerception, 2006
- The common information of two dependent random variablesIEEE Transactions on Information Theory, 1975
- A note on entropy metricsInformation and Control, 1973
- The early days of information theoryIEEE Transactions on Information Theory, 1973
- Entropy and semivaluations on semilatticesKodai Mathematical Journal, 1970
- A metric space of discrete probability distributionsInformation and Control, 1961
- The bandwagon (Edtl.)IRE Transactions on Information Theory, 1956
- The lattice theory of informationTransactions of the IRE Professional Group on Information Theory, 1953
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948