Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 355

The DOI matches its Crossref record.

How to encode the modulo-two sum of binary sources (Corresp.)

Korner, J., Marton, K.·1979·IEEE Transactions on Information Theory
DOI 10.1109/tit.1979.1056022
Open this paper in CoChat — free account

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.1979.1056022

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 355

Metadata

Authors
Korner, J., & Marton, K.
Venue
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
1979-03
Volume
25
Issue
2
Pages
219-221
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
DOI
10.1109/tit.1979.1056022
OpenAlex
W2019307453
Cited by
355
References
0
FWCI
3.70
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: How to encode the modulo-two sum of binary sources (Corresp.). https://app.cochat.ai/papers/10.1109/tit.1979.1056022
The paper
Korner, J., & Marton, K. (1979). How to encode the modulo-two sum of binary sources (Corresp.). IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1979.1056022

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.