DocumentCode :
3433793
Title :
A note on covering radius of MacDonald codes
Author :
Bhandari, M.C. ; Durairajan, C.
Author_Institution :
Dept. of Math., Indian Inst. of Technol., Kanpur, India
fYear :
2003
fDate :
28-30 April 2003
Firstpage :
221
Lastpage :
225
Abstract :
We determine 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).
Keywords :
linear codes; matrix algebra; 4-dimensional q-ary code; covering radius; linear codes; optimal codes; q-ary MacDonald code; Art; Binary codes; Character generation; Educational institutions; Galois fields; Government; Hamming distance; Linear code; Mathematics; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology: Coding and Computing [Computers and Communications], 2003. Proceedings. ITCC 2003. International Conference on
Print_ISBN :
0-7695-1916-4
Type :
conf
DOI :
10.1109/ITCC.2003.1197530
Filename :
1197530
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3433793
بازگشت