A coding model for a multiple-access adder channel

MaRDI QIDQ1162486zbMATH OpenFDO

Authors Arkadii G. D'yachkov, Vyacheslav V. Rykov

Publication date 1981

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

zero error probabilityupper and lower bounds for the length of an optimal code

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Cited in

(6)

• Coding for the Multiple-Access Adder Channel
• Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
• Random and quasi-random designs in group testing
• Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
• Signature codes for noisy multiple access adder channel
• Compositional restricted multiple access channel

This page was built for publication: A coding model for a multiple-access adder channel

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