Rank-metric codes with local recoverability

Swanand Kadhe, Salim El Rouayheb, Iwan Duursma, Alex Sprintson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We construct rank-metric codes with locality constraints under the rank-metric. Our motivation stems from designing codes for efficient data recovery from correlated and/or mixed (i.e., complete and partial) failures in distributed storage systems. Specifically, the proposed local rank-metric codes can recover locally from crisscross failures, which affect a limited number of rows and/or columns of the storage system. First, we prove a Singleton-like upper bound on the minimum rank-distance of linear codes with rank-locality constraints. Second, we construct a family of locally recoverable rank-metric codes that achieve this bound for a broad range of parameters. The proposed construction builds upon Tamo and Barg's method for constructing locally repairable codes with optimal minimum Hamming distance.

Original languageEnglish (US)
Title of host publication54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1033-1040
Number of pages8
ISBN (Electronic)9781509045495
DOIs
StatePublished - Feb 10 2017
Event54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016 - Monticello, United States
Duration: Sep 27 2016Sep 30 2016

Publication series

Name54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016

Other

Other54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
CountryUnited States
CityMonticello
Period9/27/169/30/16

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Hardware and Architecture
  • Control and Optimization

Fingerprint Dive into the research topics of 'Rank-metric codes with local recoverability'. Together they form a unique fingerprint.

  • Cite this

    Kadhe, S., El Rouayheb, S., Duursma, I., & Sprintson, A. (2017). Rank-metric codes with local recoverability. In 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016 (pp. 1033-1040). [7852348] (54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ALLERTON.2016.7852348