| Abstract |
|
In this paper we deter ine an upper bound for the covering radius of a q-ary MacDonald code Ck,u(q). Values of
nq(4, d), the minimal length of a 4-dimensional q-ary code
with minimum distance d is obtained for d = q2 - 1 and
q2 - 2. These are used to determine the covering radius of
C3,1(q), C3,2(q) and C4,2(q).
|
 Additional Information
|
Index Terms- Linear Codes, Covering radius, MacDonald
codes, Optimal codes
Citation:
M. C. Bhandari, C. Durairajan,
"A NOTE ON COVERING RADIUS OF MacDonald CODES,"
itcc,
p. 221,
International Conference on Information Technology: Computers and Communications,
2003
|
