A note on Shannon entropy
classification
💻 cs.IT
math.IT
keywords
entropyshannonfadeevaxiomatisationdifferentequivalentessentiallygive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.