西南交通大学学报(英文版)2004，Vol.12Issue(1)：73-78,6.
Chinese Remainder Codes
Chinese Remainder Codes
张爱丽 1刘秀峰 1靳蕃2
作者信息
- 1. Department of Applied Mathematics, Southwest Jiaotong University, Chengdu 610031, China
- 2. School of Computer and Communication Engineering, Southwest Jiaotong University, Chengdu 610031, China
- 折叠
摘要
Abstract
Chinese Remainder Codes are constructed by applying weak block designs and 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 asssign 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. There exist many code classes in Chinese Remainder Codes, which 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 CodesKey words
Block design/Chinese Remainder Theorem/Error-correcting codes/Sun Zi Codes引用本文复制引用
张爱丽,刘秀峰,靳蕃..Chinese Remainder Codes[J].西南交通大学学报(英文版),2004,12(1):73-78,6.
