DocumentCode :
930122
Title :
No primitive binary 
-error-correcting BCH code with 
is quasi-perfect (Corresp.)
-error-correcting BCH code with is quasi-perfect (Corresp.)Author :
Helleseth, Tor
Volume :
25
Issue :
3
fYear :
1979
fDate :
5/1/1979 12:00:00 AM
Firstpage :
361
Lastpage :
362
Abstract :
Gorenstein, Peterson, and Zierler have conjectured that no -error-correcting BCH code of length 
with is quasi-perfect. This conjecture is proved. The covering radius of a code is defined as the smallest integer 
such that the union of the spheres of radius ia about the codewords equals the containing space.
-error-correcting BCH code of length with is quasi-perfect. This conjecture is proved. The covering radius of a code is defined as the smallest integer such that the union of the spheres of radius ia about the codewords equals the containing space.Keywords :
BCH codes; Broadcasting; Chromium; Data compression; Degradation; Mutual information; Notice of Violation; Random variables; Source coding; Terminology;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1979.1056043
Filename :
1056043
Link To Document :
