∊-MSR codes with small sub-packetization

نویسندگان

  • Ankit Singh Rawat
  • Itzhak Tamo
  • Venkatesan Guruswami
  • Klim Efremenko
چکیده

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 bandwidth. However, the construction of exact-repairable MSR codes requires working with a large sub-packetization level, which restricts the employment of these codes in practice. This paper explores exact-repairable MDS codes that significantly reduce the required sub-packetization level by achieving slightly sub-optimal repair bandwidth as compared to the MSR codes. This paper presents a general approach to combine an MSR code with large sub-packetization level with a code with large enough minimum distance to construct exact-repairable MDS codes with small sub-packetization level and near-optimal repair bandwidth. For a given number of parity blocks, the codes constructed using this approach have their sub-packetization level scaling logarithmically with the code length. In addition, the obtained codes require field size linear in the code length and ensure load balancing among the intact code blocks in terms of the information downloaded from these blocks during a node repair.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d = k+1, k+2, k+3$

This paper presents the construction of an explicit, optimal-access, high-rate MSR code for any (n, k, d = k + 1, k + 2, k + 3) parameters over the finite field FQ having sub-packetization α = qd n q e, where q = d − k + 1 and Q = O(n). The sub-packetization of the current construction meets the lower bound proven in a recent work by Balaji et al. in [1]. To our understanding the codes presente...

متن کامل

Constructions of High-Rate MSR Codes over Small Fields

Three constructions of minimum storage regenerating (MSR) codes are presented. The first two constructions provide access-optimal MSR codes, with two and three parities, respectively, which attain the sub-packetization bound for access-optimal codes. The third construction provides larger MSR codes with three parities, which are not access-optimal, and do not necessarily attain the sub-packetiz...

متن کامل

An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and d < (n - 1)

This paper presents an explicit construction for an ((n = 2qt, k = 2q(t−1), d = n−(q+1)), (α = q(2q)t−1, β = α q )) regenerating code over a field FQ operating at the Minimum Storage Regeneration (MSR) point. The MSR code can be constructed to have rate k/n as close to 1 as desired, sub-packetization level α ≤ r nr for r = (n− k), field size Q no larger than n and where all code symbols can be ...

متن کامل

Enabling All-Node-Repair in Minimum Storage Regenerating Codes

We consider the problem of constructing exact-repair minimum storage regenerating (MSR) codes, for which both the systematic nodes and parity nodes can be repaired optimally. Although there exist several recent explicit high-rate MSR code constructions (usually with certain restrictions on the coding parameters), quite a few constructions in the literature only allow the optimal repair of syste...

متن کامل

Locally Repairable and Locally Regenerating Codes by Parity-Splitting of HashTag Codes

We construct an explicit family of locally repairable and locally regenerating codes whose existence was proven in a recent work by Kamath et al. about codes with local regeneration but no explicit construction was given. This explicit family of codes is based on HashTag codes. HashTag codes are recently defined vector codes with different vector length α (also called a sub-packetization level)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017