Optimal binary locally repairable codes via anticodes

Natalia Silberstein; Alexander Zeh

doi:10.1109/ISIT.2015.7282655

Optimal binary locally repairable codes via anticodes

Natalia Silberstein, Alexander Zeh

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

49 Scopus citations

Abstract

This paper presents a construction for several families of optimal binary locally repairable codes (LRCs) with small locality (2 and 3). This construction is based on various anticodes. It provides binary LRCs which attain the Cadambe-Mazumdar bound. Moreover, most of these codes are optimal with respect to the Griesmer bound.

Original language	English
Title of host publication	Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
Publisher	Institute of Electrical and Electronics Engineers
Pages	1247-1251
Number of pages	5
ISBN (Electronic)	9781467377041
DOIs	https://doi.org/10.1109/ISIT.2015.7282655
State	Published - 28 Sep 2015
Externally published	Yes
Event	IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: 14 Jun 2015 → 19 Jun 2015

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2015-June
ISSN (Print)	2157-8095

Conference

Conference	IEEE International Symposium on Information Theory, ISIT 2015
Country/Territory	Hong Kong
City	Hong Kong
Period	14/06/15 → 19/06/15

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2015.7282655

Cite this

Silberstein, N., & Zeh, A. (2015). Optimal binary locally repairable codes via anticodes. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (pp. 1247-1251). Article 7282655 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT.2015.7282655

@inproceedings{8e195db36e454fad9a1a635b3d32647c,

title = "Optimal binary locally repairable codes via anticodes",

abstract = "This paper presents a construction for several families of optimal binary locally repairable codes (LRCs) with small locality (2 and 3). This construction is based on various anticodes. It provides binary LRCs which attain the Cadambe-Mazumdar bound. Moreover, most of these codes are optimal with respect to the Griesmer bound.",

author = "Natalia Silberstein and Alexander Zeh",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",

year = "2015",

month = sep,

day = "28",

doi = "10.1109/ISIT.2015.7282655",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers",

pages = "1247--1251",

booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",

address = "United States",

}

Silberstein, N & Zeh, A 2015, Optimal binary locally repairable codes via anticodes. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015., 7282655, IEEE International Symposium on Information Theory - Proceedings, vol. 2015-June, Institute of Electrical and Electronics Engineers, pp. 1247-1251, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 14/06/15. https://doi.org/10.1109/ISIT.2015.7282655

Optimal binary locally repairable codes via anticodes. / Silberstein, Natalia; Zeh, Alexander.
Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers, 2015. p. 1247-1251 7282655 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal binary locally repairable codes via anticodes

AU - Silberstein, Natalia

AU - Zeh, Alexander

PY - 2015/9/28

Y1 - 2015/9/28

N2 - This paper presents a construction for several families of optimal binary locally repairable codes (LRCs) with small locality (2 and 3). This construction is based on various anticodes. It provides binary LRCs which attain the Cadambe-Mazumdar bound. Moreover, most of these codes are optimal with respect to the Griesmer bound.

AB - This paper presents a construction for several families of optimal binary locally repairable codes (LRCs) with small locality (2 and 3). This construction is based on various anticodes. It provides binary LRCs which attain the Cadambe-Mazumdar bound. Moreover, most of these codes are optimal with respect to the Griesmer bound.

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

U2 - 10.1109/ISIT.2015.7282655

DO - 10.1109/ISIT.2015.7282655

M3 - Conference contribution

AN - SCOPUS:84969772226

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1247

EP - 1251

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers

T2 - IEEE International Symposium on Information Theory, ISIT 2015

Y2 - 14 June 2015 through 19 June 2015

ER -

Optimal binary locally repairable codes via anticodes

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this