Block-punctured binary simplex codes for local and parallel repair in distributed storage systems_

Jung Hyun Kim; Min Kyu Song; Hong Yeop Song

doi:10.1587/transfun.E101.A.2374

Block-punctured binary simplex codes for local and parallel repair in distributed storage systems_

Jung Hyun Kim, Min Kyu Song, Hong Yeop Song

Department of Electrical and Electronic Engineering

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

4 Citations (Scopus)

Abstract

In this paper, we investigate how to obtain binary locally repairable codes (LRCs) with good locality and availability from binary Simplex codes. We first propose a Combination code having the generator matrix with all the columns of positive weights less than or equal to a given value. Such a code can be also obtained by puncturing all the columns of weights larger than a given value from a binary Simplex Code. We call by block-puncturing such puncturing method. Furthermore, we suggest a heuristic puncturing method, called subblock-puncturing, that punctures a few more columns of the largest weight from the Combination code. We determine the minimum distance, locality, availability, joint information locality, joint information availability of Combination codes in closed-form. We also demonstrate the optimality of the proposed codes with certain choices of parameters in terms of some well-known bounds.

Original language	English
Pages (from-to)	2374-2381
Number of pages	8
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E101A
Issue number	12
DOIs	https://doi.org/10.1587/transfun.E101.A.2374
Publication status	Published - 2018 Dec

Bibliographical note

Funding Information:
Manuscript received January 6, 2018. Manuscript revised July 24, 2018. †The author is with Samsung Electronics, Seoul, Korea. ††The authors are with Yonsei University, Seoul, Korea. ∗He had contributed to this work while he had been with Yonsei University, Seoul, Korea. ∗∗This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. 2017R1A2B4011191). a) E-mail: jh.kim06@yonsei.ac.kr b) E-mail: mk.song@yonsei.ac.kr c) E-mail: hysong@yonsei.ac.kr (Corresponding author) DOI: 10.1587/transfun.E101.A.2374

Publisher Copyright:
Copyright © 2018 The Institute of Electronics, Information and Communication Engineers.

All Science Journal Classification (ASJC) codes

Signal Processing
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1587/transfun.E101.A.2374

Cite this

@article{f949c355d5114859af03d33a25dad62b,

title = "Block-punctured binary simplex codes for local and parallel repair in distributed storage systems_",

abstract = "In this paper, we investigate how to obtain binary locally repairable codes (LRCs) with good locality and availability from binary Simplex codes. We first propose a Combination code having the generator matrix with all the columns of positive weights less than or equal to a given value. Such a code can be also obtained by puncturing all the columns of weights larger than a given value from a binary Simplex Code. We call by block-puncturing such puncturing method. Furthermore, we suggest a heuristic puncturing method, called subblock-puncturing, that punctures a few more columns of the largest weight from the Combination code. We determine the minimum distance, locality, availability, joint information locality, joint information availability of Combination codes in closed-form. We also demonstrate the optimality of the proposed codes with certain choices of parameters in terms of some well-known bounds.",

author = "Kim, {Jung Hyun} and Song, {Min Kyu} and Song, {Hong Yeop}",

note = "Funding Information: Manuscript received January 6, 2018. Manuscript revised July 24, 2018. †The author is with Samsung Electronics, Seoul, Korea. ††The authors are with Yonsei University, Seoul, Korea. ∗He had contributed to this work while he had been with Yonsei University, Seoul, Korea. ∗∗This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. 2017R1A2B4011191). a) E-mail: jh.kim06@yonsei.ac.kr b) E-mail: mk.song@yonsei.ac.kr c) E-mail: hysong@yonsei.ac.kr (Corresponding author) DOI: 10.1587/transfun.E101.A.2374 Publisher Copyright: Copyright {\textcopyright} 2018 The Institute of Electronics, Information and Communication Engineers.",

year = "2018",

month = dec,

doi = "10.1587/transfun.E101.A.2374",

language = "English",

volume = "E101A",

pages = "2374--2381",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "12",

}

TY - JOUR

T1 - Block-punctured binary simplex codes for local and parallel repair in distributed storage systems_

AU - Kim, Jung Hyun

AU - Song, Min Kyu

AU - Song, Hong Yeop

N1 - Funding Information: Manuscript received January 6, 2018. Manuscript revised July 24, 2018. †The author is with Samsung Electronics, Seoul, Korea. ††The authors are with Yonsei University, Seoul, Korea. ∗He had contributed to this work while he had been with Yonsei University, Seoul, Korea. ∗∗This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. 2017R1A2B4011191). a) E-mail: jh.kim06@yonsei.ac.kr b) E-mail: mk.song@yonsei.ac.kr c) E-mail: hysong@yonsei.ac.kr (Corresponding author) DOI: 10.1587/transfun.E101.A.2374 Publisher Copyright: Copyright © 2018 The Institute of Electronics, Information and Communication Engineers.

PY - 2018/12

Y1 - 2018/12

N2 - In this paper, we investigate how to obtain binary locally repairable codes (LRCs) with good locality and availability from binary Simplex codes. We first propose a Combination code having the generator matrix with all the columns of positive weights less than or equal to a given value. Such a code can be also obtained by puncturing all the columns of weights larger than a given value from a binary Simplex Code. We call by block-puncturing such puncturing method. Furthermore, we suggest a heuristic puncturing method, called subblock-puncturing, that punctures a few more columns of the largest weight from the Combination code. We determine the minimum distance, locality, availability, joint information locality, joint information availability of Combination codes in closed-form. We also demonstrate the optimality of the proposed codes with certain choices of parameters in terms of some well-known bounds.

AB - In this paper, we investigate how to obtain binary locally repairable codes (LRCs) with good locality and availability from binary Simplex codes. We first propose a Combination code having the generator matrix with all the columns of positive weights less than or equal to a given value. Such a code can be also obtained by puncturing all the columns of weights larger than a given value from a binary Simplex Code. We call by block-puncturing such puncturing method. Furthermore, we suggest a heuristic puncturing method, called subblock-puncturing, that punctures a few more columns of the largest weight from the Combination code. We determine the minimum distance, locality, availability, joint information locality, joint information availability of Combination codes in closed-form. We also demonstrate the optimality of the proposed codes with certain choices of parameters in terms of some well-known bounds.

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

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

U2 - 10.1587/transfun.E101.A.2374

DO - 10.1587/transfun.E101.A.2374

M3 - Article

AN - SCOPUS:85057463878

SN - 0916-8508

VL - E101A

SP - 2374

EP - 2381

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 12

ER -

Block-punctured binary simplex codes for local and parallel repair in distributed storage systems_

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this