Skip to Main Content
Let be a binary majority-logic decodable code with as its generator polynomial and odd minimum distance . Let be the subset code generated by ). This correspondence shows that is majority-logic deeodable with orthogonal estimates. This fact is useful in the simultaneous correction of random errors and erasures.