DocumentCode
1410297
Title
Linear codes with covering radius 2 and other new covering codes
Author
Gabidulin, Ernst M. ; Davydov, A.A. ; Tombak, L.M.
Author_Institution
Moscow Inst. of Phys. & Technol.
Volume
37
Issue
1
fYear
1991
fDate
1/1/1991 12:00:00 AM
Firstpage
219
Lastpage
224
Abstract
Infinite families of linear binary codes with covering radius R =2 and minimum distance d =3 and d =4 are given. Using the constructed codes with d =3, R =2, families of covering codes with R >2 are obtained. The parameters of many constructed codes with R ⩽2 are better than the parameters of known codes. The parity check matrices of constructed codes with d =4, R =2 are equivalent to complete caps in projective geometry
Keywords
codes; covering codes; covering radius; linear binary codes; minimum distance; parity check matrices; Binary codes; Error correction codes; Geometry; Information systems; Information theory; Linear code; Parity check codes; Physics; Random processes; Signal processing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.61146
Filename
61146
Link To Document