A multiuser k-ary code for the noisy multiple-access adder channel

DOI10.1109/18.945276zbMATH Open0999.94023OpenAlexW2156096782MaRDI QIDQ4544705FDOQ4544705

Yoichiro Watanabe, Jun Cheng

Publication date: 4 August 2002

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

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

Recommendations

• Further results on coding for T-user multiple-access channels (Corresp.)
• Nearly optimal multiuser codes for the binary adder channel
• Superimposed codes for the multiaccess binary adder channel
• Coding for Adder Channels
• Coding for the Multiple-Access Adder Channel

zbMATH Keywords

\(\delta\)-decodable codemultiple-access adder channelmultiuser code

Mathematics Subject Classification ID

Combinatorial codes (94B25) Channel models (including quantum) in information and communication theory (94A40)

Cited In (7)

• Nearly optimal multiuser codes for the binary adder channel
• Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets
• A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing
• Title not available (Why is that?)
• Further results on coding for T-user multiple-access channels (Corresp.)
• Title not available (Why is that?)
• Signature codes for noisy multiple access adder channel

This page was built for publication: A multiuser k-ary code for the noisy multiple-access adder channel

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