loading...
A NOTE ON COVERING RADIUS OF MacDonald CODES
Las Vegas, Nevada April 28-April 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197530International Conference on Informati ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
M. C. Bhandari, Indian Institute of Technology Kanpur
C. Durairajan, Government Arts College
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).
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, pp.221, International Conference on Information Technology: Computers and Communications, 2003
Usage of this product signifies your acceptance of the Terms of Use.