On an infinite series of[4n, 2n]binary codes (Corresp.)

This correspondence deals with an infinite series of binary, reversible
[4n, 2n, 4], n \geq 2
, unequal error protection codes, which are majority logic decodable. The weight enumerators and automorphism groups are determined completely. For n even the codes are self dual. By pasting together copies of a
[4n,2n,4]
code, binary codes with parameters
[8n,2n,8]
for
n \geq 2, [8n,2n,12]
for
n \geq 4
, and
[12n,2n,16]
and
[16n,2n,24]
for
n \geq 3
are obtained.