Compute-and-forward for discrete memoryless networks

Consider a receiver that observes multiple interfering codewords. The compute-and-forward technique makes it possible for the receiver to directly decode linear combinations of the codewords. Previous work has focused on compute-and-forward for linear Gaussian networks. This paper explores the corresponding technique for discrete memoryless networks. As a by-product, this leads to a novel way of attaining non-trivial points on the dominant face of the capacity region of discrete memoryless multiple-access channels.


Published in:
Proceedings of the 2014 IEEE Information Theory Workshop, 5-9
Presented at:
2014 IEEE Information Theory Workshop, Hobart, Tasmania, Australia, November 2-5, 2014
Year:
2014
Keywords:
Laboratories:




 Record created 2015-03-10, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)