New upper bounds on the covering radius of codes with known dual distance

S. Litsyn, P. Soldé, A. Tietäväinen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Using the linear programming approach and the concept of weighted coverings we derive new upper bounds on the covering radius of codes with a given cardinality and a given dual distance. There has been a recent revival of interest in the problem of finding upper bounds on the covering radius of a code as a function of its size, dual distance or minimal distance. This problem relates to some methods of coding for write-once memories, interconnection networks, quantization, etc. If we assume that the minimal distance of a linear code is greater than 3 then the problem corresponds to evaluating the diameter of a subclass of Cayley graphs over Z2r of given degree and robustness.

Original languageEnglish
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Pages304
Number of pages1
DOIs
StatePublished - 1994
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/TerritoryNorway
CityTrondheim
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'New upper bounds on the covering radius of codes with known dual distance'. Together they form a unique fingerprint.

Cite this