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

Math @ Duke



Publications [#235753] of Robert Calderbank

Papers Published

  1. Goparaju, S; Calderbank, R, Binary cyclic codes that are locally repairable, IEEE International Symposium on Information Theory - Proceedings (January, 2014), pp. 676-680, ISSN 2157-8095 [doi]
    (last updated on 2017/12/17)

    Codes for storage systems aim to minimize the repair locality, which is the number of disks (or nodes) that participate in the repair of a single failed disk. Simultaneously, the code must sustain a high rate, operate on a small finite field to be practically significant and be tolerant to a large number of erasures. To this end, we construct new families of binary linear codes that have an optimal dimension (rate) for a given minimum distance and locality. Specifically, we construct cyclic codes that are locally repairable for locality 2 and distances 2, 6 and 10. In doing so, we discover new upper bounds on the code dimension, and prove the optimality of enabling local repair by provisioning disjoint groups of disks. Finally, we extend our construction to build codes that have multiple repair sets for each disk. © 2014 IEEE.
ph: 919.660.2800
fax: 919.660.2821

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