An upper bound for codes for the noisy two-access binary adder channel (Corresp.)
Henk van Tilborg · IEEE Transactions on Information Theory · 1986
Using earlier methods a combinatorial upper bound is derived for|C|. \cdot |D|, where(C,D)is a\delta-decodable code pair for the noisy two-access binary adder channel. Asymptotically, this bound reduces toR_{1}=R_{2} \leq \frac{3}{2} + e\log_{2} e - (\frac{1}{2} + e) \log_{2} (1 + 2e)= \frac{1}{2} - e + H(\frac{1}{2} - e) - \frac{1}{2}H(2e),wheree = \lfloor (\delta - 1)/2 \rfloor /n, n \rightarrow \inftyandR_{1}resp.R_{2}is the rate of the codeCresp.D.