On binary majority-logic decodable codes (Corresp.)

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.