Title :
An asymptotic bound on the covering radii of binary BCH codes
Author :
Tietäväinen, Aimo A.
Author_Institution :
Dept. of Math., Turku Univ., Finland
fDate :
1/1/1990 12:00:00 AM
Abstract :
P. Deligne´s theorem (1974) is used to prove that the covering radius of a primitive binary BCH code with designed distance 2t+1 is equal to 2t-1 if t is of the form 2 u+1 and the code length is at least (2t)4t-2 . It is believed that this is the first time Deligne´s theorem is used on coding theory
Keywords :
error correction codes; Deligne´s theorem; asymptotic bound; coding theory; covering radius; primitive binary BCH code; Electromagnetic fields; Electromagnetic radiation; Noise reduction; Notice of Violation; Optical fiber communication; Optical propagation; Optical receivers; Optimized production technology; Quantum mechanics; Testing;
Journal_Title :
Information Theory, IEEE Transactions on
