On an infinite series of[4n, 2n]binary codes (Corresp.)
Léon M.H.E. Driessen · IEEE Transactions on Information Theory · 1984
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]forn \geq 2, [8n,2n,12]forn \geq 4, and[12n,2n,16]and[16n,2n,24]forn \geq 3are obtained.