New Constructions of Binary LRCs with Disjoint Repair Groups and Locality 3 Using Existing LRCs

Chanki Kim; Jong Seon No

doi:10.1109/LCOMM.2019.2892950

New Constructions of Binary LRCs with Disjoint Repair Groups and Locality 3 Using Existing LRCs

Chanki Kim^*
, Jong Seon No

^*Corresponding author for this work

Department of Computer Science & Artificial Intelligence

Seoul National University

Research output: Contribution to journal › Journal article › peer-review

13 Scopus citations

Abstract

New constructions of linear binary locally repairable codes (LRCs) with disjoint repair groups, locality 3, and minimum Hamming distance larger than or equal to six are proposed by using existing binary LRCs. The proposed linear binary LRCs are optimal or near-optimal in terms of the bound of binary LRCs with disjoint repair groups.

Original language	English
Article number	8611379
Pages (from-to)	406-409
Number of pages	4
Journal	IEEE Communications Letters
Volume	23
Issue number	3
DOIs	https://doi.org/10.1109/LCOMM.2019.2892950
State	Published - 2019

Keywords

Cyclic codes
distributed storage systems (DSSs)
locally repairable codes (LRCs)

Access to Document

10.1109/LCOMM.2019.2892950

Cite this

@article{8ea873957a3441759b279e3bfb8bfc74,

title = "New Constructions of Binary LRCs with Disjoint Repair Groups and Locality 3 Using Existing LRCs",

abstract = "New constructions of linear binary locally repairable codes (LRCs) with disjoint repair groups, locality 3, and minimum Hamming distance larger than or equal to six are proposed by using existing binary LRCs. The proposed linear binary LRCs are optimal or near-optimal in terms of the bound of binary LRCs with disjoint repair groups.",

keywords = "Cyclic codes, distributed storage systems (DSSs), locally repairable codes (LRCs)",

author = "Chanki Kim and No, \{Jong Seon\}",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.",

year = "2019",

doi = "10.1109/LCOMM.2019.2892950",

language = "English",

volume = "23",

pages = "406--409",

journal = "IEEE Communications Letters",

issn = "1089-7798",

number = "3",

}

TY - JOUR

T1 - New Constructions of Binary LRCs with Disjoint Repair Groups and Locality 3 Using Existing LRCs

AU - Kim, Chanki

AU - No, Jong Seon

PY - 2019

Y1 - 2019

N2 - New constructions of linear binary locally repairable codes (LRCs) with disjoint repair groups, locality 3, and minimum Hamming distance larger than or equal to six are proposed by using existing binary LRCs. The proposed linear binary LRCs are optimal or near-optimal in terms of the bound of binary LRCs with disjoint repair groups.

AB - New constructions of linear binary locally repairable codes (LRCs) with disjoint repair groups, locality 3, and minimum Hamming distance larger than or equal to six are proposed by using existing binary LRCs. The proposed linear binary LRCs are optimal or near-optimal in terms of the bound of binary LRCs with disjoint repair groups.

KW - Cyclic codes

KW - distributed storage systems (DSSs)

KW - locally repairable codes (LRCs)

UR - https://www.scopus.com/pages/publications/85062956937

U2 - 10.1109/LCOMM.2019.2892950

DO - 10.1109/LCOMM.2019.2892950

M3 - Journal article

AN - SCOPUS:85062956937

SN - 1089-7798

VL - 23

SP - 406

EP - 409

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 3

M1 - 8611379

ER -

New Constructions of Binary LRCs with Disjoint Repair Groups and Locality 3 Using Existing LRCs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this