An information - theoretic proof of Hadamard's inequality (Corresp.)
From MaRDI portal
Publication:3315430
DOI10.1109/TIT.1983.1056751zbMATH Open0532.94005OpenAlexW1979142560MaRDI QIDQ3315430FDOQ3315430
Authors: Thomas M. Cover, A. A. El Gamal
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1983.1056751
Recommendations
- scientific article; zbMATH DE number 1081116
- scientific article; zbMATH DE number 1121120
- scientific article; zbMATH DE number 2107680
- On an inequality from information theory
- Information Theoretic Proofs of Entropy Power Inequalities
- Proving and Disproving Information Inequalities: Theory and Scalable Algorithms
- Information theoretic inequalities
- An information-theoretic proof of a finite de Finetti theorem
- An information-theoretic proof of Nash's inequality
- A combinatorial approach to information inequalities
Measures of information, entropy (94A17) Determinants, permanents, traces, other special matrix functions (15A15)
This page was built for publication: An information - theoretic proof of Hadamard's inequality (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315430)