Chinese remainder codes
Aili Zhang , Xiufeng Liu
Front. Math. China ›› 2006, Vol. 1 ›› Issue (3) : 452 -461.
Chinese remainder codes
Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I1 ∩ I2 ∩ ··· ∩ In for the information bit, embed R/Ji into R/I1 ∩ I2 ∩ ··· ∩ In, and assign the cosets of R/Ji as the subring of R/I1 ∩ I2 ∩ ··· ∩ In and the cosets of R/Ji in R/I1 ∩ I2 ∩ ··· ∩ In as check lines. Many code classes exist in the Chinese remainder codes that have high code rates. Chinese remainder codes are the essential generalization of Sun Zi codes.
block design / Chinese remainder theorem / error-correcting codes / Sun Zi codes / 13Hxx
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
Jin F. On a new combinatorial coding method and generation of optimal linear codes. In: 1987 Intenational Conference on Communication Technology, Nanjing. 1987. 858–962 |
| [6] |
Jin F. A new combinatorial coding method and its application for constructing optimal error-control codes. In: 1986 IEEE International Symposium on Information Theory, Ann, Arbor, USA. 1986. 1–8 |
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
Zhang A L, Jin F, Liu X F. Weak block design and class of 2-error correcting codes. In 1998 Taiwan and Mainland Conference on Communication Technology and Signal Process, Xi’an Jiaotong University. 1998. 221–223 (in Chinese) |
| [11] |
|
| [12] |
|
/
| 〈 |
|
〉 |