Locally repairable codes from combinatorial designs

Abstract

Locally repairable codes (LRCs) were proposed to reduce the repair degree in distributed storage systems. In particular, LRCs with availability are highly desirable for distributed storage systems, since this kind of codes provide the mechanism of local repair for code symbols and parallel reading of hot data. In this paper, we propose four types of (n, k, r, t)q LRCs from combinatorial designs. We introduce several constructions of LRCs with strict availability and some constructions of distance-optimal LRCs with information-symbol locality. Most of our constructions in this paper are over \({\mathbb{F}_2}\), i.e., they are suitable for implementation.

This is a preview of subscription content, access via your institution.

References

  1. 1

    Balaji S B, Krishnan M N, Vajha M, et al. Erasure coding for distributed storage: an overview. Sci China Inf Sci, 2018, 61: 100301

    Article  Google Scholar 

  2. 2

    Dimakis A G, Godfrey P B, Wu Y, et al. Network coding for distributed storage systems. IEEE Trans Inform Theory, 2010, 56: 4539–4551

    Article  Google Scholar 

  3. 3

    Liang S T, Liang W J, Kan H B. Construction of one special minimum storage regenerating code when α = 2. Sci China Inf Sci, 2015, 58: 062308

    MathSciNet  Google Scholar 

  4. 4

    Gopalan P, Huang C, Simitci H, et al. On the locality of codeword symbols. IEEE Trans Inform Theory, 2012, 58: 6925–6934

    MathSciNet  Article  Google Scholar 

  5. 5

    Jin L F, Ma L M, Xing C P. Construction of optimal locally repairable codes via automorphism groups of rational function fields. 2017. ArXiv:1710.09638

  6. 6

    Jin L F. Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes. IEEE Trans Inform Theory, 2019, 65: 4658–4663

    MathSciNet  Article  Google Scholar 

  7. 7

    Prakash N, Kamath G M, Lalitha V, et al. Optimal linear codes with a local-error-correction property. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Cambridge, 2012. 2776–2780

  8. 8

    Wang A Y, Zhang Z F. Repair locality with multiple erasure tolerance. IEEE Trans Inform Theory, 2014, 60: 6979–6987

    MathSciNet  Article  Google Scholar 

  9. 9

    Rawat A S, Papailiopoulos D S, Dimakis A G, et al. Locality and availability in distributed storage. IEEE Trans Inform Theory, 2016, 62: 4481–4493

    MathSciNet  Article  Google Scholar 

  10. 10

    Su Y S. Design of membership matrices for (r, t)-availability in distributed storage. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Barcelona, 2016. 998–1002

  11. 11

    Hao J, Xia S T. Constructions of optimal binary locally repairable codes with multiple repair groups. IEEE Commun Lett, 2016, 20: 1060–1063

    Article  Google Scholar 

  12. 12

    Balaji S B, Kumar P V. Bounds on the rate and minimum distance of codes with availability. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Aachen, 2017. 3155–3159

  13. 13

    Zhang Y, Kan H B. Locally repairable codes with strict availability from linear functions. Sci China Inf Sci, 2018, 61: 109304

    MathSciNet  Article  Google Scholar 

  14. 14

    Balaji S B, Prasanth K P, Kumar P V. Binary codes with locality for multiple erasures having short block length. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Barcelona, 2016. 655–659

  15. 15

    Tamo I, Barg A, Frolov A. Bounds on the parameters of locally recoverable codes. IEEE Trans Inform Theory, 2016, 62: 3070–3083

    MathSciNet  Article  Google Scholar 

  16. 16

    Prakash N, Lalitha V, Kumar P V. Codes with locality for two erasures. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Honolulu, 2014. 1962–1966

  17. 17

    Colbourn C J, Dinitz J H. Handbook of Combinatorial Designs. 2nd ed. Boca Raton: CRC Press, 2006

    Google Scholar 

  18. 18

    Wan Z X. Design Theory. Beijing: Higher Education Press, 2009

    Google Scholar 

  19. 19

    Wang A, Zhang Z, Liu M. Achieving arbitrary locality and availability in binary codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Hong Kong, 2015. 1866–1870

  20. 20

    Huang P, Yaakobi E, Uchikawa H, et al. Linear locally repairable codes with availability. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Hong Kong, 2015. 1871–1875

  21. 21

    Olmez O, Ramamoorthy A. Repairable replication-based storage systems using resolvable designs. In: Proceedings of the 50th Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2012. 1174–1181

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant No. 61672166), Plan of Shanghai Excellent Academic Leaders (Grant No. 16XD1400200), Innovation Plan of Shanghai Science and Technology (Grant No. 16JC1402700) and Shanghai Leading Talent Programmes.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Haibin Kan.

Additional information

Supporting information

Appendix A. The supporting information is available online at info.scichina.com and link. springer.com. The supporting materials are published as submitted, without typesetting or editing. The responsibility for scientific accuracy and content remains entirely with the authors.

Supplementary File

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Zhang, Y., Kan, H. Locally repairable codes from combinatorial designs. Sci. China Inf. Sci. 63, 122304 (2020). https://doi.org/10.1007/s11432-019-2649-5

Download citation

Keywords

  • locally repairable codes
  • erasure codes
  • combinatorial designs
  • distributed storage systems
  • codes with availability