Linear codes for the sum mod-2 multiple-access channel with restricted access

Transmission of information through a multiple-access-modulo-2 adder channel is addressed for the situation that out of a fixed family of N potential users at most some m, m >

[1]  Peter Mathys,et al.  A class of codes for a T active users out of N multiple-access communication system , 1990, IEEE Trans. Inf. Theory.

[2]  László Györfi,et al.  Constructions of binary constant-weight cyclic codes and cyclically permutable codes , 1992, IEEE Trans. Inf. Theory.

[3]  Raphael Rom,et al.  Forward collision resolution - A technique for random multiple-access to the adder channel , 1993, IEEE Trans. Inf. Theory.

[4]  B. Rimoldi,et al.  Coding for the F-Adder Channel: Two Applications of Reed Solomon Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.

[5]  Bixio Rimoldi.  Coding for the Gaussian Multiple-Access Channel: An Algebraic Approach , 1993, Proceedings. IEEE International Symposium on Information Theory.