The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Linear codes for sources and source networks: Error exponents, universal coding
Abstract
For Slepian-Wolf source networks, the error exponents obtained by Körner,Marton, and the author are shown to be universally attainable by linear codes also. Improved exponents are derived for linear codes with "large rates." Specializing the results to simple discrete memoryless sources reveals their relationship to the random coding and expurgated bounds for channels with additive noise. One corollary is that there are universal linear codes for this class of channels which attain the random coding error exponent for each channel in the class. The combinatorial approach of Csiszár-Körner-Marton is used. In particular, all results are derived from a lemma specifying good encoders in terms of purely combinatorial properties.
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.
Integrity signals
Registry
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.
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
Cites
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Recent results in the Shannon theory
Wyner, A. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055171 · Cited by 633
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 · Cited by 355
Asymptotic Optimality of Group and Systematic Codes for Some Channels
Dobrushin, R. L. (1963) · Theory of Probability and Its Applications · doi:10.1137/1108003 · Cited by 61
Cited by
Computation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
Metadata
- Authors
- Csiszar, I.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1982-07
- Volume
- 28
- Issue
- 4
- Pages
- 585-592
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2088587246
- Cited by
- 263
- References
- 6
- FWCI
- 0.00
- 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: Linear codes for sources and source networks: Error exponents, universal coding. https://app.cochat.ai/papers/10.1109/tit.1982.1056524
- The paper
- Csiszar, I. (1982). Linear codes for sources and source networks: Error exponents, universal coding. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1982.1056524
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.
