Covering Radius 1985–1994 |
| |
| Authors: | G D Cohen S N Litsyn A C Lobstein H F Mattson Jr |
| |
| Affiliation: | (1) Ecole Nationale Supérieure des Télécommunications, 46 rue Barrault, F-75634 Paris cédex 13, France (e-mail: cohen@inf.enst.fr), FR;(2) Department of Electrical Engineering-Systems, Tel-Aviv University, Ramat-Aviv, 69978, Israel (e-mail: litsyn@eng.tau.ac.il), IL;(3) Centre National de la Recherche Scientifique, Ecole Nationale Supérieure des Télécommunications, 46 rue Barrault, F-75634 Paris cédex 13, France (e-mail: lobstein@inf.enst.fr), FR;(4) School of Computer and Information Science, 2-120 Center for Science and Technology, Syracuse, NY 13244-4100, USA (e-mail: hmattson@syr.edu), US |
| |
| Abstract: | 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.
Received October 28, 1994; revised version May 28, 1996 |
| |
| 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 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
