A general construction for PMDS codes

Gokhan Calis; O. Ozan Koyluoglu

doi:10.1109/LCOMM.2016.2627569

A general construction for PMDS codes

Gokhan Calis, O. Ozan Koyluoglu

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

35 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 language	English (US)
Article number	7740918
Pages (from-to)	452-455
Number of pages	4
Journal	IEEE Communications Letters
Volume	21
Issue number	3
DOIs	https://doi.org/10.1109/LCOMM.2016.2627569
State	Published - Mar 2017

Keywords

Gabidulin codes
PMDS codes
combinatorial designs
maximally recoverable codes

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2016.2627569

Cite this

@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 = "Gabidulin codes, PMDS codes, combinatorial designs, maximally recoverable codes",

author = "Gokhan Calis and Koyluoglu, {O. Ozan}",

note = "Funding Information: This work was supported by NSF under grant CCF-1563622. The associate editor coordinating the review of this letter and approving it for publication was C. Feng. Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2017",

month = mar,

doi = "10.1109/LCOMM.2016.2627569",

language = "English (US)",

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

N1 - Funding Information: This work was supported by NSF under grant CCF-1563622. The associate editor coordinating the review of this letter and approving it for publication was C. Feng. Publisher Copyright: © 1997-2012 IEEE.

PY - 2017/3

Y1 - 2017/3

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 - Gabidulin codes

KW - PMDS codes

KW - combinatorial designs

KW - maximally recoverable 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

AN - SCOPUS:85015765036

VL - 21

SP - 452

EP - 455

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 3

M1 - 7740918

ER -

A general construction for PMDS codes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this