Computation codes in network information theory are designed for the scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding that such function decoding can be achieved more efficiently than decoding the full information sources. Compute-and-forward has shown that function decoding, in combination with network coding ideas, is a useful building block for end-to-end communication. In both cases, good computation codes are the key component in the coding schemes. In this work, we expose the fact that good computation codes could undermine the capability of the codes for recovering the information sources individually, e.g., for the purpose of multiple access and distributed source coding.Particularly, we establish duality results between the codes which are good for computation and the codes which are good for multiple access or distributed compression. DRAFT codewords f 1 (M 1 , M 2 ) = x n 1 (M 1 ) + x n 2 (M 2 ) is often of particular interest. The computation problem associated with Decoder 1 is a basic building block for many complex communication networks, including the well-known two-way relay channel [1] [2], and general multi-layer relay networks [3]. The computation aspect of these schemes is important, sometimes even imperative in multi-user communication networks. Results from network coding [4] [5], physical network coding [6], and the compute-forward scheme [3] have all shown that computing certain functions of codewords within a communication network is vital to the overall coding strategy, and their performance cannot be achieved otherwise. Previous studies have all suggested that good computation codes should possess some algebraic structures. For example, nested lattice codes are used in the Gaussian two-way relay channel and more generally in the compute-and-forward scheme. In this case, the linear structure of the codes is the key to the coding scheme, due to the fact that multiple codeword pairs result in the same sum codeword, thus minimizing the number of competing sum codewords upon decoding.However, it turns out that this algebraic structure could be "harmful", if the codes are used for the purpose of multiple-access. Roughly speaking, if the channel has a "similar" algebraic structure (looking October 9, 2018 DRAFT