A coding model for a multiple-access adder channel

zbMath0481.94003MaRDI QIDQ1162486

Vyacheslav V. Rykov, Arkadii G. D'yachkov

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)

Related Items (6)

Random and quasi-random designs in group testing ⋮ Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory ⋮ 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 ⋮ Coding for the Multiple-Access Adder Channel

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