Abstract
Let V\prime be a binary (n,k) majority-logic decodable code with g\prime (X) as its generator polynomial and odd minimum distance d . Let V be the (n, k - 1) subset code generated by g\prime (X)(1 + X ). This correspondence shows that V is majority-logic deeodable with d + 1 orthogonal estimates. This fact is useful in the simultaneous correction of random errors and erasures.
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.
