Abstract
The article provides a method of formation of the sum code with minimum total number of undetectable errors in data vectors. The idea of building this code is based on the principle of weighing of data vector bits, obtaining the weight of data vector and following modifications of its value. New code has the same number of bits in check vectors, as classic Berger code, however, it also has high detection ability and, that is by no means unimportant, in the area of low multiplicities. The article gives the description of modified weight-based sum code characteristics, as well as the results of experiments for organization of concurrent error detection (CED) systems for the set of reference combinational circuits LGSynth'89.
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.
