TL;DR
This paper offers a new perspective on Shannon entropy, providing an alternative axiomatisation and a novel proof of Fadeev's theorem, enhancing theoretical understanding of entropy measures.
Contribution
It introduces a different approach to Shannon entropy and presents a new proof of Fadeev's theorem, enriching the theoretical foundation.
Findings
New proof of Fadeev's theorem
Alternative axiomatisation of Shannon entropy
Deeper understanding of entropy properties
Abstract
We present a somewhat different way of looking on Shannon entropy. This leads to an axiomatisation of Shannon entropy that is essentially equivalent to that of Fadeev. In particular we give a new proof of Fadeev theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Mechanics and Entropy · Wireless Communication Security Techniques · Computability, Logic, AI Algorithms