Abstract

This article introduces a parity-check code based on the Rademacher function. The error-correction model of the code corresponds to a binary symmetrical channel: bits may be inverted randomly and independently, but no bit insertion/bit omission occurs. The code corrects a single error; its redundancy and coding/decoding features are virtually identical with those of the Hamming code, but it has clear advantages for application of redundant coding in fault-tolerant integrated-circuit design.

Full Text
Paper version not known

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 call

Disclaimer: 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.