Covering Radius 1985–1994

被引:0
作者
G. D. Cohen
S. N. Litsyn
A. C. Lobstein
H. F. Mattson Jr.
机构
[1] Ecole Nationale Supérieure des Télécommunications,
[2] 46 rue Barrault,undefined
[3] F-75634 Paris cédex 13,undefined
[4] France (e-mail: cohen@inf.enst.fr),undefined
[5] Department of Electrical Engineering-Systems,undefined
[6] Tel-Aviv University,undefined
[7] Ramat-Aviv,undefined
[8] 69978,undefined
[9] Israel (e-mail: litsyn@eng.tau.ac.il),undefined
[10] Centre National de la Recherche Scientifique,undefined
[11] Ecole Nationale Supérieure des Télécommunications,undefined
[12] 46 rue Barrault,undefined
[13] F-75634 Paris cédex 13,undefined
[14] France (e-mail: lobstein@inf.enst.fr),undefined
[15] School of Computer and Information Science,undefined
[16] 2-120 Center for Science and Technology,undefined
[17] Syracuse,undefined
[18] NY 13244-4100,undefined
[19] USA (e-mail: hmattson@syr.edu),undefined
来源
Applicable Algebra in Engineering, Communication and Computing | 1997年 / 8卷
关键词
Keywords: Amalgamated direct sum; Binary codes; Blockwise direct sum; BCH codes; Covering radius; Density of coverings; Dual distance; Excess method; Normality; Reed-Muller codes; Sphere-covering bound.;
D O I
暂无
中图分类号
学科分类号
摘要
 We survey important developments in the theory of covering radius during the period 1985–1994. We present lower bounds, constructions and upper bounds, the linear and nonlinear cases, density and asymptotic results, normality, specific classes of codes, covering radius and dual distance, tables, and open problems.
引用
收藏
页码:173 / 239
页数:66
相关论文
empty
未找到相关数据