Nearly optimal multiuser codes for the binary adder channel

DOI10.1109/18.485711zbMATH Open0855.94002OpenAlexW2105081412MaRDI QIDQ4885670FDOQ4885670

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

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

zbMATH Keywords

capacity regionzero-error capacitymultiuser codesmultiaccess communicationbinary adder channel

Mathematics Subject Classification ID

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

Cited In (16)

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

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)