연산과 다중접속 부호화 관계 분석

Abstract

For a two-user Gaussian multiple access channel,computation codes are designed for the scenarios where thedecoder is not interested in decoding the two codewords, but onlythe sum of them. It has been observed that good computationcodes should possess some algebraic structure. In this note, weexpose the fact that such algebraic structure could underminethe capability of the codes for recovering the messages, i.e., forthe purpose of multiple-access. Particularly, we establish dualityresults between the codes which are good for computation andthe codes which are good for multiple access.des should possess some algebraic structure. In this note, weexpose the fact that such algebraic structure could underminethe capability of the codes for recovering the messages, i.e., forthe purpose of multiple-access. Particularly, we establish dualityresults between the codes which are good for computation andthe codes which are good for multiple access.