An upper bound for codes for the noisy two-access binary adder channel (Corresp.)

DOI10.1109/TIT.1986.1057173zbMath0594.94012MaRDI QIDQ3726002

Henk C. A. van Tilborg

Publication date: 1986

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

zbMATH Keywords

combinatorial upper bounddecodable code pair

Mathematics Subject Classification ID

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

This page was built for publication: An upper bound for codes for the noisy two-access binary adder channel (Corresp.)