Welcome to IEEE Xplore 2.0: How to encode the modulo-two sum of binary sources (Corresp.)

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

How to encode the modulo-two sum of binary sources (Corresp.)
Korner, J. Marton, K.

This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Mar 1979
Volume: 25, Issue: 2
On page(s): 219- 221
ISSN: 0018-9448
Current Version Published: 2003-01-06

Abstract
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 memoryless 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.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.