Superimposed codes for the multiaccess binary adder channel

DOI10.1109/18.391266zbMATH Open0830.94020OpenAlexW2088698325MaRDI QIDQ4857526FDOQ4857526

Authors:

Publication date: 4 February 1996

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

Full work available at URL: https://semanticscholar.org/paper/e1334f61e6efad37c4d8c6f642ddf50aa0ca2ddc

Recommendations

• Superimposed codes in the Hamming space
• scientific article; zbMATH DE number 1421000
• scientific article; zbMATH DE number 4164725
• scientific article; zbMATH DE number 2154117
• Coding for the Multiple-Access Adder Channel

zbMATH Keywords

decoding algorithmssuperimposed codesconstant-weight codemultiple-access communicationadder channel

Mathematics Subject Classification ID

Communication theory (94A05) Decoding (94B35) Other types of codes (94B60)

Cited In (11)

• Nearly optimal multiuser codes for the binary adder channel
• Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets
• Linear codes for the sum mod-2 multiple-access channel with restricted access
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A multiuser k-ary code for the noisy multiple-access adder channel
• Title not available (Why is that?)
• Single-User Tracing and Disjointly Superimposed Codes
• Title not available (Why is that?)
• Union-intersection-bounded families and their applications

This page was built for publication: Superimposed codes for the multiaccess binary adder channel

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