On characterization of entropy function via information inequalities
On characterization of entropy function via information inequalities
复制标题
DOI：
10.1109/isit.1998.708980
复制
发表时间：
1998-07
期刊：
影响因子：
--
通讯作者：
Zhen Zhang;R. Yeung
中科院分区：
文献类型：
--
作者：
Zhen Zhang;R. Yeung
讨论了香农信息测度的基本信息不等式的性质。这些性质完全表征了熵函数吗？为了使这个问题更精确，我们将熵函数视为2n-1维向量，其中坐标由基集（1,2，…）的子集索引。, n)。本文的主要发现是一个包含4个离散随机变量的新的信息不等式，它给出了这个信息论基本问题的否定答案。
The properties of the so-called basic information inequalities of Shannon's information measures are discussed. Do these properties fully characterize the entropy function? To make this question more precise, we view an entropy function as a 2n-1 dimensional vector where the coordinates are indexed by the subsets of the ground set (1, 2, ..., n). The main discovery of this paper is a new information inequality involving 4 discrete random variables which gives a negative answer to this fundamental problem of information theory.