Coding for the F-Adder Channel: Two Applications of Reed Solomon Codes

Given any finite field F, the F-adder channel is the channel whose inputs are elements of F and the output is the sum (over F) of the inputs. It is shown how Reed Solomon (RS) codes can be used to obtain multiple access multiple-rate codes of convolutional type for the F-adder channel. It is also shown that when the F adder channel is noisy, the codewords of a multiple access multi-rate code for the F-adder channel can be protected in a simple and flexible manner by means of RS codes.