Document Type
Report
Date
11-1994
Keywords
radius
Language
English
Disciplines
Computer Sciences
Description/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.
Recommended Citation
Cohen, G. D.; Litsyn, S. N.; Lobstein, Antoine C.; and Mattson, H. F. Jr, "Covering Radius 1985-1994" (1994). Electrical Engineering and Computer Science - Technical Reports. 150.
https://surface.syr.edu/eecs_techreports/150
Source
local
Additional Information
School of Computer and information Science, Syracuse University, SU-CIS-94-9
Authors later published: Cohen, G. D., Litsyn, S. N., Lobstein, A. C., & Mattson Jr, H. F. (1997). Covering Radius 1985–1994. Applicable Algebra in Engineering, Communication and Computing, 8(3), 173-239. doi: 10.1007/s002000050061