Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
