Nearly optimal multiuser codes for the binary adder channel

DOI10.1109/18.485711MaRDI QIDQ4885670zbMATH OpenOpenAlexFDO

Authors Brian L. Hughes, A. Brinton Cooper III

Publication date 28 July 1996

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

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

zbMATH Keywords

binary adder channelcapacity regionmultiaccess communicationmultiuser codeszero-error capacity

Mathematics Subject Classification ID

Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• A multiuser k-ary code for the noisy multiple-access adder channel
• Upper bound for uniquely decodable codes in a binary input N-user adder channel
• On perfect codes for an additive channel
• scientific article; zbMATH DE number 721901
• An upper bound for codes for the noisy two-access binary adder channel (Corresp.)
• scientific article; zbMATH DE number 1129498
• Code construction for the T-user noiseless adder channel
• Publication:4945063
• Superimposed codes for the multiaccess binary adder channel
• Coding capacity for a class of additive channels

Cited in

(16)

• Construction of high rate \(\mathcal {T}\)-direct codes
• scientific article; zbMATH DE number 3843653 (Why is no real title available?)
• Further results on coding for T-user multiple-access channels (Corresp.)
• scientific article; zbMATH DE number 4031571 (Why is no real title available?)
• Some families of zero- error block codes for the two-user binary adder channel with feedback
• Bounds on the achievable rates of block coding for a memoryless multiple-access channel
• scientific article; zbMATH DE number 1129498 (Why is no real title available?)
• A multiuser k-ary code for the noisy multiple-access adder channel
• A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing
• Limitations of the capacity of the M-user binary adder channel due to physical considerations
• Coding for Adder Channels
• scientific article; zbMATH DE number 1420991 (Why is no real title available?)
• Remark on ``on the capacity of a multiple-access vector adder channel
• Coding for the Multiple-Access Adder Channel
• Coding and capacity calculation for the \(\mathcal{T}\)-user \(F\)-adder channel
• Entropy and the discrete central limit theorem

This page was built for publication: Nearly optimal multiuser codes for the binary adder channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885670)