Binary Locally Repairable Codes with Minimum Distance at Least Six Based on Partial $t$-Spreads

Mi Young Nam; Hong Yeop Song

doi:10.1109/LCOMM.2017.2697424

Binary Locally Repairable Codes with Minimum Distance at Least Six Based on Partial $t$-Spreads

Mi Young Nam, Hong Yeop Song

Department of Electrical and Electronic Engineering

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

17 Citations (Scopus)

Abstract

We propose a new construction for binary locally repairable codes (LRCs) based on a (partial) $t$-spread, which constructs an LRC with minimum distance ≥and any locality geq . Furthermore, we found that there are some cases in which the resulting codes are optimum in terms of the upper bound by Cadambe and Mazumdar in 2015.

Original language	English
Article number	7909000
Pages (from-to)	1683-1686
Number of pages	4
Journal	IEEE Communications Letters
Volume	21
Issue number	8
DOIs	https://doi.org/10.1109/LCOMM.2017.2697424
Publication status	Published - 2017 Aug

Bibliographical note

Funding Information:
Manuscript received January 26, 2017; revised March 21, 2017; accepted April 12, 2017. Date of publication April 20, 2017; date of current version August 10, 2017. This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. 2013R1A1A2062061). The associate editor coordinating the review of this letter and approving it for publication was B. Smida. (Corresponding author: Hong-Yeop Song.) The authors are with the Department of Electrical and Electronic Engineering, Yonsei University, Seoul 120-749, South Korea (e-mail: hysong@ yonsei.ac.kr). Digital Object Identifier 10.1109/LCOMM.2017.2697424

Publisher Copyright:
© 2017 IEEE.

All Science Journal Classification (ASJC) codes

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2017.2697424

Cite this

@article{ab20d8ddf61241a1a95866d15bd7938a,

title = "Binary Locally Repairable Codes with Minimum Distance at Least Six Based on Partial $t$-Spreads",

abstract = "We propose a new construction for binary locally repairable codes (LRCs) based on a (partial) $t$-spread, which constructs an LRC with minimum distance ≥and any locality geq . Furthermore, we found that there are some cases in which the resulting codes are optimum in terms of the upper bound by Cadambe and Mazumdar in 2015.",

author = "Nam, {Mi Young} and Song, {Hong Yeop}",

note = "Funding Information: Manuscript received January 26, 2017; revised March 21, 2017; accepted April 12, 2017. Date of publication April 20, 2017; date of current version August 10, 2017. This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. 2013R1A1A2062061). The associate editor coordinating the review of this letter and approving it for publication was B. Smida. (Corresponding author: Hong-Yeop Song.) The authors are with the Department of Electrical and Electronic Engineering, Yonsei University, Seoul 120-749, South Korea (e-mail: hysong@ yonsei.ac.kr). Digital Object Identifier 10.1109/LCOMM.2017.2697424 Publisher Copyright: {\textcopyright} 2017 IEEE.",

year = "2017",

month = aug,

doi = "10.1109/LCOMM.2017.2697424",

language = "English",

volume = "21",

pages = "1683--1686",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

T1 - Binary Locally Repairable Codes with Minimum Distance at Least Six Based on Partial $t$-Spreads

AU - Nam, Mi Young

AU - Song, Hong Yeop

N1 - Funding Information: Manuscript received January 26, 2017; revised March 21, 2017; accepted April 12, 2017. Date of publication April 20, 2017; date of current version August 10, 2017. This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. 2013R1A1A2062061). The associate editor coordinating the review of this letter and approving it for publication was B. Smida. (Corresponding author: Hong-Yeop Song.) The authors are with the Department of Electrical and Electronic Engineering, Yonsei University, Seoul 120-749, South Korea (e-mail: hysong@ yonsei.ac.kr). Digital Object Identifier 10.1109/LCOMM.2017.2697424 Publisher Copyright: © 2017 IEEE.

PY - 2017/8

Y1 - 2017/8

N2 - We propose a new construction for binary locally repairable codes (LRCs) based on a (partial) $t$-spread, which constructs an LRC with minimum distance ≥and any locality geq . Furthermore, we found that there are some cases in which the resulting codes are optimum in terms of the upper bound by Cadambe and Mazumdar in 2015.

AB - We propose a new construction for binary locally repairable codes (LRCs) based on a (partial) $t$-spread, which constructs an LRC with minimum distance ≥and any locality geq . Furthermore, we found that there are some cases in which the resulting codes are optimum in terms of the upper bound by Cadambe and Mazumdar in 2015.

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

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

U2 - 10.1109/LCOMM.2017.2697424

DO - 10.1109/LCOMM.2017.2697424

M3 - Article

AN - SCOPUS:85028958940

SN - 1089-7798

VL - 21

SP - 1683

EP - 1686

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 8

M1 - 7909000

ER -

Binary Locally Repairable Codes with Minimum Distance at Least Six Based on Partial $t$-Spreads

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this