A general coding scheme for the nonrestricted memoryless discrete two-way channel is presented based on the introduction of auxiliary random variables forming a stationary Markov process. The coding scheme yields an achievable rate region which exceeds the inner bound of Shannon in the general case. A finite cardinality bound for the auxiliary random variables is given, showing that the region is computable. Finally, the capacity region for the memoryless Gaussian two-way channel is established.
No takes yet. Share an insight, caveat, or question.
Te Sun Han (1984) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: