Error-correcting signature code for multiple-access adder channel

Error-correcting signature code is proposed. An n/2-decodable signature code with code length n - 1 and cardinality n - 1 is developed from an Hadamard matrix of order n. The code is used to identify users through the multiple-access adder channel, even in the presence of channel noise

[1]  G. H. Khachatrian,et al.  Code Construction for the T-User Noiseless Adder Channel , 1998, IEEE Trans. Inf. Theory.

[2]  Kin-ichiroh Tokiwa,et al.  A Code Construction for M-Choose-T Communication over the Multiple-Access Adder Channel , 1995 .

[3]  László Györfi,et al.  Superimposed codes in Rn , 1988, IEEE Trans. Inf. Theory.

[4]  Shih-Chun Chang,et al.  Further results on coding for T-user multiple-access channels , 1984, IEEE Trans. Inf. Theory.

[5]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[6]  Brian L. Hughes,et al.  Nearly optimal multiuser codes for the binary adder channel , 1996, IEEE Trans. Inf. Theory.

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

[8]  D. V. Gokhale,et al.  A Survey of Statistical Design and Linear Models. , 1976 .

[9]  Jun Cheng,et al.  A multiuser k-ary code for the noisy multiple-access adder channel , 2001, IEEE Trans. Inf. Theory.

[10]  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.

[11]  Thomas J. Ferguson.  Generalized T-user codes for multiple-access channels , 1982, IEEE Trans. Inf. Theory.

[12]  T. Bohman.  A sum packing problem of Erdös and the Conway-Guy sequence , 1996 .

[13]  Dusan B. Jevtic.  Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets , 1992, IEEE Trans. Inf. Theory.

[14]  E. J. Weldon,et al.  Coding for T-user multiple-access channels , 1979, IEEE Trans. Inf. Theory.

[15]  Dusan B. Jevtic.  On Families of Sets of Integral Vectors Whose Representatives form Sum-Distinct Sets , 1995, SIAM J. Discret. Math..

[16]  Pingzhi Fan,et al.  Superimposed codes for the multiaccess binary adder channel , 1995, IEEE Trans. Inf. Theory.

[17]  Jun Cheng,et al.  T-User Code with Arbitrary Code Length for Multiple-Access Adder Channel (Special Section on Information Theory and Its Applications) , 1999 .