MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
نویسندگان
چکیده
منابع مشابه
MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
A code C ⊆ F is a collection of M codewords where n elements (from the finite field F) in each of the codewords are referred to as code blocks. Assuming that F is a degree ` extension of a smaller field B, the code blocks are treated as `-length vectors over the base field B. Equivalently, the code is said to have the sub-packetization level `. This paper addresses the problem of constructing M...
متن کاملNew MDS codes with small sub-packetization and near-optimal repair bandwidth
An (n,M) vector code C ⊆ F is a collection ofM codewords where n elements (from the field F) in each of the codewords are referred to as code blocks. Assuming that F ∼= B, the code blocks are treated as l-length vectors over the base field B. Equivalently, the code is said to have the sub-packetization level l. This paper addresses the problem of constructing MDS vector codes which enable exact...
متن کاملExplicit MDS Codes for Optimal Repair Bandwidth
MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has r parities and no more than r erasures occur, then by transmitting all the remaining data in the code, the original information can be recovered. However, it was shown that in order to recover a single symbol erasure, only a fraction of 1/...
متن کامل∊-MSR codes with small sub-packetization
Minimum storage regenerating (MSR) codes form a special class of maximum distance separable (MDS) codes by providing mechanisms for exact regeneration of a single code block in their codewords by downloading the minimum amount of information from the remaining code blocks. As a result, the MSR codes find application to distributed storage systems to enable node repairs with the optimal repair b...
متن کاملA Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes
Let C be an {(n, k, d), (α, β)} linear, Minimum Storage Regenerating (MSR) code over the vector alphabet Fq with linear repair of a failed node. Then C has the property that repair of the failure of any one single node (data or parity) can be carried out using linear operations, by uniformly downloading β symbols from a collection of d helper nodes. It is known that the minimum amount dβ of dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2810095