Error codes constructed in residue number systems with non-pairwise-prime moduli

Codes constructed in a Residue Number System (RNS) of moduli m1, m2, ..., mn are non-binary, arithmetic codes whose codewords are vectors where the ith component is mi-valued (1 ≤ i ≤ n). A new class of codes in RNS is described, where redundancy is introduced by removing the constraint that the moduli of the RNS be pairwise prime. The error-detecting and correcting capabilities of such codes are discussed and a simple approach to error detection, localization and correction is presented. Although the codes under consideration are quite inefficient in some respects, it is shown that codes is examined in more detail. Codes in this subclass, besides correcting all single errors, also correct almost all of double errors and localize some errors of higher multiplicity, with less redundancy than required to construct optimal 2-correcting codes in RNS