%0 Journal Article
%T Coding for a Noisy Binary Multiple-access Adder Channel
%J American Journal of Computational and Applied Mathematics
%@ 2165-8943
%D 2013
%I 
%R 10.5923/j.ajcam.20130301.04
%X Multiple-access adder channels have been extensively studied for manyyears. They can be classified into several types. The type of channels weconsider in this paper is discrete,memoryless, synchronized and noisy. On noisy multiple-access adder channels a receiver must derive a groupof transmitted codewords uniquely from a received word garbled by errors. Thismeans that a code suitable for this channel must have both separabilityand error control ability. In this paper we propose a coding method forsuch a channel.Our method utilizes some property of parity check matrices for Reeed-Solomon codes. We present not only encoding but also decoding methods of our codes. It is also shown that our method can construct some codes with high coding rates.
%K Multiple-Access Adder Channel
%K Error Correcting
%K Detecting
%K Wireless Communications
%U http://article.sapub.org/10.5923.j.ajcam.20130301.04.html