A NOTE ON COVERING RADIUS OF MacDonald CODES

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by M. C. Bhandari Articles by C. Durairajan

International Conference on Information Technology: Computers and Communications

Las Vegas, Nevada

April 28-April 30

ISBN: 0-7695-1916-4

	ASCII Text	x
	M. C. Bhandari, C. Durairajan, "A NOTE ON COVERING RADIUS OF MacDonald CODES," Information Technology: Coding and Computing, International Conference on, pp. 221, International Conference on Information Technology: Computers and Communications, 2003.

	BibTex	x
	@article{ 10.1109/ITCC.2003.1197530, author = {M. C. Bhandari and C. Durairajan}, title = {A NOTE ON COVERING RADIUS OF MacDonald CODES}, journal ={Information Technology: Coding and Computing, International Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1916-4}, pages = {221}, doi = {http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197530}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Information Technology: Coding and Computing, International Conference on TI - A NOTE ON COVERING RADIUS OF MacDonald CODES SN - 0-7695-1916-4 SP EP A1 - M. C. Bhandari, A1 - C. Durairajan, PY - 2003 KW - Linear Codes KW - Covering radius KW - MacDonald codes KW - Optimal codes VL - 0 JA - Information Technology: Coding and Computing, International Conference on ER -

M. C. Bhandari, Indian Institute of Technology Kanpur

C. Durairajan, Government Arts College

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197530

In this paper we deter ine an upper bound for the covering radius of a q-ary MacDonald code C_k,u(q). Values of n_q(4, d), the minimal length of a 4-dimensional q-ary code with minimum distance d is obtained for d = q² - 1 and q² - 2. These are used to determine the covering radius of C_3,1(q), C_3,2(q) and C_4,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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.