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

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

doi:10.1109/ISIT.1994.394714

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

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

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 Z₂^r of given degree and robustness.

Original language	English
Title of host publication	Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Pages	304
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1994.394714
State	Published - 1994
Event	1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway Duration: 27 Jun 1994 → 1 Jul 1994

Publication series

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

Conference

Conference	1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/Territory	Norway
City	Trondheim
Period	27/06/94 → 1/07/94

Access to Document

10.1109/ISIT.1994.394714

Cite this

@inproceedings{f191dd2746d045009941858e61f123e8,

title = "New upper bounds on the covering radius of codes with known dual distance",

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.",

author = "S. Litsyn and P. Sold{\'e} and A. Tiet{\"a}v{\"a}inen",

year = "1994",

doi = "10.1109/ISIT.1994.394714",

language = "אנגלית",

isbn = "0780320158",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "304",

booktitle = "Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994",

note = "1994 IEEE International Symposium on Information Theory, ISIT 1994 ; Conference date: 27-06-1994 Through 01-07-1994",

}

Litsyn, S, Soldé, P & Tietäväinen, A 1994, New upper bounds on the covering radius of codes with known dual distance. in Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994., 394714, IEEE International Symposium on Information Theory - Proceedings, pp. 304, 1994 IEEE International Symposium on Information Theory, ISIT 1994, Trondheim, Norway, 27/06/94. https://doi.org/10.1109/ISIT.1994.394714

New upper bounds on the covering radius of codes with known dual distance. / Litsyn, S.; Soldé, P.; Tietäväinen, A.
Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. 1994. p. 304 394714 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Litsyn, S.

AU - Soldé, P.

AU - Tietäväinen, A.

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84894294077&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1994.394714

DO - 10.1109/ISIT.1994.394714

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84894294077

SN - 0780320158

SN - 9780780320154

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 304

BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994

T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994

Y2 - 27 June 1994 through 1 July 1994

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this