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

Author

Driessen, Leon M H E

Volume

Issue

fYear

1984

fDate

3/1/1984 12:00:00 AM

Firstpage

392

Lastpage

395

Abstract

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.

Keywords

Error-correction coding; Majority logic decoding; Binary codes; Block codes; Decoding; Error correction; Error correction codes; Error probability; Logic; Nearest neighbor searches; Notice of Violation; Telecommunications;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.1984.1056866

Filename

1056866

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=938443

On an infinite series of binary codes (Corresp.)

Driessen, Leon M H E

jour

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