arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.0070cs.ITmath.COmath.IT
收藏

熵距离

Entropy Distance

Shengtian Yang

摘要:

受随机线性码方法的启发,有限域上向量空间中的一个新距离被定义为汉明球的“表面积”的对数,其半径是对应的汉明距离。由于它与熵函数有着密切的联系,所以被称为熵距离。证明了熵距离对于非二元域是一个度量,对于二元域是一个伪度量。线性码的熵距离被定义为码的不同码字之间的最小熵距离。类比的吉尔伯特界,汉明界,和辛格尔顿界的最大尺寸的线性代码的长度和熵距离的代码。此外,作为与无损联合信源-信道编码相关的一个重要性质,定义了线性编码器的熵距离。在给定输入输出向量空间维数的情况下,得到了线性编码器的最大熵距离的严格上界和下界。

英文摘要:

Motivated by the approach of random linear codes, a new distance in the vector space over a finite field is defined as the logarithm of the "surface area" of a Hamming ball with radius being the corresponding Hamming distance. It is named entropy distance because of its close relation with entropy function. It is shown that entropy distance is a metric for a non-binary field and a pseudometric for the binary field. The entropy distance of a linear code is defined to be the smallest entropy distance between distinct codewords of the code. Analogues of the Gilbert bound, the Hamming bound, and the Singleton bound are derived for the largest size of a linear code given the length and entropy distance of the code. Furthermore, as an important property related to lossless joint source-channel coding, the entropy distance of a linear encoder is defined. Very tight upper and lower bounds are obtained for the largest entropy distance of a linear encoder with given dimensions of input and output vector spaces.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑