On Lower Bounds For Covering Codes期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

On Lower Bounds For Covering Codes

Authors:	M. C. Bhandari K. K. P. Chanduka A. K. Lal

Affiliation:	(1) Department of Mathematics, Indian Institute of Technology, Kanpur, INDIA–, 208 016

Abstract:	We study lower bounds on K(n,R), the minimum number of codewords of any binary code of length n such that the Hamming spheres of radius R with center at codewords cover the Hamming space $mathbb{F}_(text(2))n$ . We generalize Honkala's idea toobtain further improvements only by using some simple observationsof Zhang's result. This leads to nineteen improvements of thelower bound on K(n,R) within the range of .

Keywords:	binary covering code covering radius sphere bound
本文献已被 SpringerLink 等数据库收录！