Abstract
In a residue code with the moduli m 1, m 2,…, m n the integer X is represented by the vectorial form { r 1, r 2,…, r n }, such that r i ≡ X mod m i , i = 1,2,…, n. Since the moduli are not pairwise relative primes, not every n-tuple of integers {r i, ¦0 ⩽r i < m i, i = 1,2,…, n} represents a code word: only those satisfying r i = r j mod g ij , where g ij is the greatest common divisor of m i and m j . Thus redundancy is introduced in a distributed way, inherent in the structure of the system. Known theorems on the error detecting, identifying, and correcting capacity of such codes are generalized. Application to brain modeling is touched upon.
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.
