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...

Full description

Saved in:

Bibliographic Details
Published in:	Designs, codes, and cryptography Vol. 88; no. 9; pp. 1741 - 1757
Main Authors:	Tan, Pan, Zhou, Zhengchun, Sidorenko, Vladimir, Parampalli, Udaya
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2020 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!