A practical implementation of computation codes for computing sums

In this paper we propose a coding and decoding strategy for computing modulo M sums in a Multiple Access Channel over Additive White Gaussian Noise based on linear codes in F_M. The complexity of our strategy is the same as the complexity of the linear code and we show that when there are 2 users in the network and M = 2, our strategy is close to the theoretical limit. We also provide some figures in which it is possible to appreciate that good codes in a point to point scenario are also good codes for computing modulo M sums.