Two classes of optimal LRCs with information (r, t)-locality

Locally repairable codes (LRCs) with ( r , t )-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becom...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Designs, codes, and cryptography Ročník 88; číslo 9; s. 1741 - 1757
Hlavní autori:	Tan, Pan, Zhou, Zhengchun, Sidorenko, Vladimir, Parampalli, Udaya
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2020 Springer Nature B.V
Predmet:	Coding and Information Theory Computer Science Cryptology Discrete Mathematics in Computer Science Linear algebra Parameters Special Issue: Coding and Cryptography 2019 Storage systems Partial geometry Repair locality 94B25 11T71 Distributed storage systems Locally repairable codes 94B60 94A60 Multiple failures
ISSN:	0925-1022, 1573-7586
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!