Title :
On covering radius and dual distance
Author_Institution :
Dept. of Math., Turku Univ., Finland
Abstract :
We estimate the covering radius of a code when the dual distance is known. New bounds on covering radii of linear codes are derived. Also bounds for self-complementary and even-weight codes are presented
Keywords :
binary codes; linear codes; polynomials; binary linear codes; bounds; constant weight code; covering radius; discrete Chebyshev polynomial; dual distance; even-weight codes; self-complementary codes; Chebyshev approximation; Computer science; Decoding; Error correction codes; H infinity control; Linear code; Polynomials;
Conference_Titel :
Information Theory Workshop, 1998
Conference_Location :
Killarney
Print_ISBN :
0-7803-4408-1
DOI :
10.1109/ITW.1998.706420
