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

The DOI matches its Crossref record.

Coding for T-user multiple-access channels

Shih-Chun Chang, Weldon, E. · 1979 · IEEE Transactions on Information Theory

Abstract

Coding schemes for the binary memorylessT-user adder channel are investigated in this paper. First upper and lower bounds on the capacity sum, which are asymptotically tight with increasingT, are derived for the noiseless case. Second, a class ofT-user uniquely decodable codes with rates, asymptotically inT, equal to the maximal achievable values is constructed. A decoding algorithm for these codes is also presented. Next, a class of error-correcting codes for the noisyT-user adder channel is constructed. It is shown that these codes can he used to construct multilevel codes suitable for use on the additive white Gaussian noise channel.

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.1056109

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 164

Metadata

Authors
Chang, S.-C., & Weldon, E.
Venue
IEEE Transactions on Information Theory
Published
1979-11
Volume
25
Issue
6
Pages
684-691
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2123704833
Cited by
164
References
0
FWCI
1.85
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: Coding for T-user multiple-access channels. https://app.cochat.ai/papers/10.1109/tit.1979.1056109
The paper
Chang, S.-C., & Weldon, E. (1979). Coding for T-user multiple-access channels. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1979.1056109

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.