DocumentCode
342538
Title
Improved estimates on covering radius
Author
Ashikhmin, A. ; Honkala, I. ; Laihonen, T. ; Litsyn, S.
Author_Institution
Los Alamos Nat. Lab., NM, USA
fYear
1999
fDate
1999
Firstpage
123
Abstract
During the last two decades the fundamental geometric parameter of a block code, called covering radius, has been widely studied. In this paper we estimate this parameter for linear codes with the aid of the minimum distance of the dual code. We derive a new bound on covering radius which improves essentially on the known bounds in a wide range of normalized dual distances
Keywords
block codes; dual codes; linear codes; parameter estimation; block code; covering radius; dual code; fundamental geometric parameter; linear codes; minimum distance; parameter estimation; Block codes; Computer science; Data compression; Error correction codes; Laboratories; Linear code; Linear programming; Parameter estimation; Polynomials; Postal services;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Communications Workshop, 1999. Proceedings of the 1999 IEEE
Conference_Location
Kruger National Park
Print_ISBN
0-7803-5268-8
Type
conf
DOI
10.1109/ITCOM.1999.781454
Filename
781454
Link To Document