HOW TO ENCODE THE MODULO-2 SUM OF BINARY SOURCES

被引：235

作者：

KORNER, J

MARTON, K

机构：

[1] Mathematical Institute of the Hungarian Academy of Sciences, H-1053 Budapest

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1979年 / 25卷 / 02期

关键词：

D O I：

10.1109/TIT.1979.1056022

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

How much separate information about two random binary sequences is needed in order to tell with small probability of error in which positions the two sequences differ? If the sequences are the outputs of two correlated memory-less binary sources, then in some cases the rate of this information may be substantially less than the joint entropy of the two sources. This result is implied by the solution of the source coding problem with two separately encoded side information sources for a special class of source distributions. © 1979 IEEE

引用

页码：219 / 221

页数：3

共 7 条

[1]

AHLSWEDE R, 1976, Z WAHRSCHEINLICHKEIT, V34, P157, DOI 10.1007/BF00535682

[2] SOURCE CODING WITH SIDE INFORMATION AND A CONVERSE FOR DEGRADED BROADCAST CHANNELS [J].