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 journalArticle

11 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

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