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

Mi Young Nam, Hong Yeop Song

Research output: Contribution to journalArticlepeer-review

16 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 languageEnglish
Article number7909000
Pages (from-to)1683-1686
Number of pages4
JournalIEEE Communications Letters
Volume21
Issue number8
DOIs
Publication statusPublished - 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

Fingerprint Dive into the research topics of 'Binary Locally Repairable Codes with Minimum Distance at Least Six Based on Partial $t$-Spreads'. Together they form a unique fingerprint.

Cite this