مرکز منطقه ای اطلاع رساني علوم و فناوري - On the covering radius of binary codes (Corresp.)

DocumentCode :

928974

Title :

On the covering radius of binary codes (Corresp.)

Author :

Helleseth, Tor ; Klove, Torleiv ; Mykkeltveit, Johannes

Volume :

Issue :

fYear :

1978

fDate :

9/1/1978 12:00:00 AM

Firstpage :

627

Lastpage :

628

Abstract :

Upper bounds on the covering radius of binary codes are studied. In particular it is shown that the covering radius $r_{m}$ of the first-order Reed-Muller code of lenglh $2^{m}$ satisfies $2^{m-l}-2^{\\lceil m/2 \\rceil -1} r_{m} \\leq 2^{m-1}-2^{m/2-1}$ .