Generic two-modulus sum codes for technical diagnostics of discrete systems problems

Abstract

The authors of this article proposed a new universal algorithm of building modified sum codes, that generalizes known methods of code formation, as well as allows to build new sum codes, implementation of which might be useful for technical diagnostics problems solving. The algorithm is based on segregation of bits into a data vector and its division onto two subsets (possibly intersecting), on the following formation of two vectors and on the calculation of the total weight values for each vector using pre-established moduli (on determination of least non-negative residue of each vector's weight). The final step of this code formation is recording in binary form into the bits of check vector the obtained values of least non-negative residue of two vectors weights for bit subset of initial data vector. The proposed algorithm is analyzed using, as an example, the formation of a new sum code with 6 data bits.