A New Upper Bound for a Binary Additive Noisy Multiple Access Channel with Feedback

We use the idea of dependence balance to obtain the first improvement over the cut-set bound for the discrete memoryless multiple access channel with noiseless feedback (MAC-FB). More specifically, we consider a binary additive noisy MAC-FB whose capacity does not coincide with the Cover-Leung achievable rate region. Evaluating the dependence balance bound is difficult due to an involved auxiliary random variable. We overcome this difficulty by using functional analysis to explicitly evaluate our upper bound for the binary additive noisy MAC-FB and show that it is strictly less than the cut-set bound for the symmetric-rate point on the capacity region.