DocumentCode :
938443
Title :
On an infinite series of ![[4n, 2n]](/images/tex/118.gif)
binary codes (Corresp.)
binary codes (Corresp.)Author :
Driessen, Leon M H E
Volume :
30
Issue :
2
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](/images/tex/5790.gif)
, 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]](/images/tex/5791.gif)
code, binary codes with parameters ![[8n,2n,8]](/images/tex/5792.gif)
for ![n \\geq 2, [8n,2n,12]](/images/tex/5793.gif)
for 
, and ![[12n,2n,16]](/images/tex/5795.gif)
and ![[16n,2n,24]](/images/tex/5796.gif)
for 
are obtained.
, 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 code, binary codes with parameters for for , and and for 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 :
