DocumentCode
940218
Title
Covering radius---Survey and recent results
Author
Cohen, Gerard D. ; Karpovsky, Mark G. ; Mattson, H.F., Jr. ; Schatz, James R.
Volume
31
Issue
3
fYear
1985
fDate
5/1/1985 12:00:00 AM
Firstpage
328
Lastpage
343
Abstract
All known results on covering radius are presented, as well as some new results. There are a number of upper and lower bounds, including asymptotic results, a few exact determinations of covering radius, some extensive relations with other aspects of coding theory through the Reed-Muller codes, and new results on the least covering radius of any linear
code. There is also a recent result on the complexity of computing the covering radius.
code. There is also a recent result on the complexity of computing the covering radius.Keywords
Bibliographies; Block coding; Binary codes; Block codes; Data compression; Distortion measurement; Helium; Lattices; Length measurement; Nonlinear distortion; Reed-Solomon codes; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1985.1057043
Filename
1057043
Link To Document