How to encode the modulo-two sum of binary sources (Corresp.)
- 1 March 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 25 (2) , 219-221
- https://doi.org/10.1109/tit.1979.1056022
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.Keywords
This publication has 5 references indexed in Scilit:
- Bounds on conditional probabilities with applications in multi-user communicationProbability Theory and Related Fields, 1976
- Source coding with side information and a converse for degraded broadcast channelsIEEE Transactions on Information Theory, 1975
- On source coding with side information at the decoderIEEE Transactions on Information Theory, 1975
- Some Methods in Multi-User Communication: A Tutorial SurveyPublished by Springer Nature ,1975
- Recent results in the Shannon theoryIEEE Transactions on Information Theory, 1974