logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

General Sub-Packetized Access-Optimal Regenerating Codes

delete2016-01-01
delete17
delete
OA
AI
K
Katina Kralevska *
D
Danilo Gligoroski
H
Harald Øverby
DOI：10.1109/LCOMM.2016.2561287delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This letter presents a novel construction of (n, k, d = n - 1) access-optimal regenerating codes for an arbitrary sub-packetization level a for exact repair of any systematic node. We refer to these codes as general sub-packetized, because we provide an algorithm for constructing codes for any a less than or equal to r([(k/r)]), where (k/r) is not necessarily an integer. This leads to a flexible construction of codes for different code rates compared with existing approaches. We derive the lower and upper bounds of the repair bandwidth. The repair bandwidth depends on the code parameters and a. The repair process of a failed systematic node is linear and highly parallelized, which means that a set of [(alpha/r)] symbols is independently repaired first and used along with the accessed data from other nodes to recover the remaining symbols.
Keywords:
Minimum storage regenerating codes
sub-packetization
access-optimal

Journal

IEEE Communications Letters cover
IEEE Communications Letters
IF:
4.4
Papers:
1.3W
Citations:
2.2W

Organization

No organization information available