A general construction for PMDS codes

Gokhan Calis, Onur Ozan Koyluoglu

Research output: Contribution to journalArticle

24 Scopus citations

Abstract

Partial MDS [(PMDS) also known as maximally recoverable] codes allow for local erasure recovery by utilizing row-wise parities and additional erasure correction through global parities. Recent works on PMDS codes focus on special case parameter settings, and a general construction for PMDS codes is stated as an open problem. This letter provides an explicit construction for PMDS codes for all parameters utilizing concatenation of Gabidulin and MDS codes, a technique originally proposed by Rawat et al. for constructing optimal locally repairable codes. This approach allows for PMDS constructions for any parameters albeit with large field sizes. To lower the field size, a relaxation on the rate requirement is considered, and PMDS codes based on combinatorial designs are constructed.

Original languageEnglish (US)
Article number7740918
Pages (from-to)452-455
Number of pages4
JournalIEEE Communications Letters
Volume21
Issue number3
DOIs
StatePublished - Mar 1 2017

Keywords

  • combinatorial designs
  • Gabidulin codes
  • maximally recoverable codes
  • PMDS codes

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A general construction for PMDS codes'. Together they form a unique fingerprint.

  • Cite this