A general construction for PMDS codes

Gokhan Calis, O. Ozan Koyluoglu

Research output: Research - peer-reviewArticle

  • 1 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.

LanguageEnglish (US)
Article number7740918
Pages452-455
Number of pages4
JournalIEEE Communications Letters
Volume21
Issue number3
DOIs
StatePublished - Mar 1 2017

Fingerprint

MDS Codes
Partial
Parity
Recovery
Combinatorial Design
Concatenation
Open Problems
Requirements

Keywords

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

ASJC Scopus subject areas

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

Cite this

A general construction for PMDS codes. / Calis, Gokhan; Koyluoglu, O. Ozan.

In: IEEE Communications Letters, Vol. 21, No. 3, 7740918, 01.03.2017, p. 452-455.

Research output: Research - peer-reviewArticle

Calis, Gokhan ; Koyluoglu, O. Ozan. / A general construction for PMDS codes. In: IEEE Communications Letters. 2017 ; Vol. 21, No. 3. pp. 452-455
@article{e0d7f7cd898c495abc830a1ded1fea4d,
title = "A general construction for PMDS codes",
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.",
keywords = "combinatorial designs, Gabidulin codes, maximally recoverable codes, PMDS codes",
author = "Gokhan Calis and Koyluoglu, {O. Ozan}",
year = "2017",
month = "3",
doi = "10.1109/LCOMM.2016.2627569",
volume = "21",
pages = "452--455",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - A general construction for PMDS codes

AU - Calis,Gokhan

AU - Koyluoglu,O. Ozan

PY - 2017/3/1

Y1 - 2017/3/1

N2 - 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.

AB - 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.

KW - combinatorial designs

KW - Gabidulin codes

KW - maximally recoverable codes

KW - PMDS codes

UR - http://www.scopus.com/inward/record.url?scp=85015765036&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015765036&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2016.2627569

DO - 10.1109/LCOMM.2016.2627569

M3 - Article

VL - 21

SP - 452

EP - 455

JO - IEEE Communications Letters

T2 - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 3

M1 - 7740918

ER -