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

Y2 - 27 June 1994 through 1 July 1994

ER -