Math @ Duke

Publications [#235807] of Robert Calderbank
Papers Published
 Calderbank, AR, Covering bounds for codes,
Journal of Combinatorial Theory, Series A, vol. 60 no. 1
(1992),
pp. 117122, ISSN 00973165
(last updated on 2018/02/19)
Abstract: Given an [n, k]R code C, and a subcode H of C with codimension j, define SHj(C) = maxx∈F2n {d(x, H) + d(x, C H)}, and define the jnorm, Sj(C) to be the minimum value of SHj(C) as H ranges over the subcodes with codimension j. We prove that if k (n + 1) > R (R + 1), then S1(C) ≤ 2R + 1. © 1992.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

