A Generalization of the Parallel Error Correcting Codes

This paper generalizes parallel error correcting codes proposed by Alshwede et al. over a type of multiple access channels called a parallel channel. The generalized parallel error correcting codes can handle with more errors compared with the original ones. We show construction methods of independent and non-independent parallel error correcting code and decoding methods. We derive some bounds about the size of respective parallel error correcting code

[1]  Emina Soljanin,et al.  Reliable channel regions for good binary codes transmitted over parallel channels , 2006, IEEE Transactions on Information Theory.

[2]  F. Lemmermeyer.  Error-correcting Codes , 2005 .

[3]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

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

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

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

[7]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[8]  TADAO KASAMI,et al.  Bounds on the achievable rates of block coding for a memoryless multiple-access channel , 1978, IEEE Trans. Inf. Theory.

[9]  László Györfi,et al.  Signature coding and information transfer for the multiple access adder channel , 2004, Information Theory Workshop.

[10]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[11]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[12]  T. Matsushima,et al.  A Generalization of the Parallel Error Correcting Codes , 2006, ITW 2006.

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

[14]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[15]  Rudolf Ahlswede,et al.  Parallel error correcting codes , 2002, IEEE Trans. Inf. Theory.