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

6 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 1

Fingerprint

Minimum Distance
Binary
Partial
Locality
Upper bound

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

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 Hong-Yeop Song",
year = "2017",
month = "8",
day = "1",
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",

}

Binary Locally Repairable Codes with Minimum Distance at Least Six Based on Partial $t$-Spreads. / Nam, Mi Young; Song, Hong-Yeop.

In: IEEE Communications Letters, Vol. 21, No. 8, 7909000, 01.08.2017, p. 1683-1686.

Research output: Contribution to journalArticle

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

PY - 2017/8/1

Y1 - 2017/8/1

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

VL - 21

SP - 1683

EP - 1686

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 8

M1 - 7909000

ER -