Coding for T-user multiple-access channels

DOI10.1109/TIT.1979.1056109zbMath0423.94007OpenAlexW2123704833MaRDI QIDQ3858125

Shih-Chun Chang, Edward J. Jun. Weldon

Publication date: 1979

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1979.1056109

zbMATH Keywords

decoding algorithmerror- correcting codesadditive white Gaussian noise channelcoding schemes for the binary memoryless multi-user adder channelmulti-level codesupper and lower bounds on the capacity sum

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Related Items (10)

Integral representations and asymptotic expansions for Shannon and Renyi entropies ⋮ Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users ⋮ On metric dimension of nonbinary Hamming spaces ⋮ Entropy and the discrete central limit theorem ⋮ Optimal schemes for combinatorial query problems with integer feedback ⋮ Signature codes for noisy multiple access adder channel ⋮ On the capacity of a multiple-access vector adder channel ⋮ Bounds for indices of coincidence and entropies ⋮ Coding for the Multiple-Access Adder Channel ⋮ Coding and Capacity Calculation for the $\mathcal{T}$ -User F-Adder Channel

This page was built for publication: Coding for T-user multiple-access channels