Chinese Remainder Codes
Received:March 05, 2001  
Key Words: linear code   congruence class   coset   ring  
Fund Project:
Author NameAffiliation
ZHANG Ai-li Dept. of Computer Science
Fudan University
Shanghai
China 
LIU Xiu-feng Dept. of Appl. Math. l Southwest Jiaotong University
Chengdu
China 
Hits: 2318
Download times: 1237
Abstract:
      Chinese remainder codes are constructed by applying the weak block design and Chinese remainder theorem of ring theory. The new type of linear codes are to take the con- gruence class in the congruence class ring R/I1∩I2∩…∩In for the information bit, to em- bed R/Ji into R/I1∩I2∩…∩In as a subring of R/I1∩I2∩…∩In, and to regard the cosets of R/Ji in R/I1∩I2∩…∩In as check lines. There exist many code classes in chinese remainder codes, which have higher code rate. Chinese remainder codes are essential generalization of Sun Zhi codes.
Citation:
DOI:10.3770/j.issn:1000-341X.2004.02.027
View Full Text  View/Add Comment