Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#236014] of Robert Calderbank

Papers Published

  1. Calderbank, AR; Sloane, NJA, Linear inequalities for covering codes, vol. 25 n 13 (1988), pp. 33-
    (last updated on 2017/12/12)

    Summary form only given, as follows. Any code C with covering radius R must satisfy a set of linear inequalities that involve the Lloyd polynomial LR(x); these generalize the sphere bound. The syndrome graphs associated with a linear code C help to keep track of low weight vectors in the same coset of C (if there are too many such vectors C cannot exist). As illustrations it is shown that t[17, 10] = 3 and t[23, 15] = 3, where t[n, k] is the smallest covering radius of any [n, k] code.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320