ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair

Guruswami, Venkatesan; Lokam, Satyanarayana V.; Jayaraman, Sai Vikneshwar Mani

doi:10.1109/tit.2020.3023110

Cited by 6 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For (n, k) MDS array code with small sub-packetization level, (1+ǫ)-optimal repair bandwidth, and repair degree d < n−1, few results have been reported in the literature. To the best of our knowledge, the only one is the construction in [29], which only works for very large parameters n, k and requires a huge finite field, thus infeasible to be implemented in practical systems. Constructions of (n, k) MDS array code over small finite fields with small sub-packetization level, (1 + ǫ)-optimal repair bandwidth, and repair degree d < n − 1 will be left for our future research.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees

Li¹,

Liu²,

Tang³

et al. 2023

Preprint

View full text Add to dashboard Cite

Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been reported in the literature. However, most of them require contacting all the surviving nodes during a node repair process, i.e., the repair degree is d = n − 1. However, connecting and downloading data from all the surviving nodes is not always feasible in practical systems, as some nodes may be unavailable.Therefore, constructions of MSR codes with repair degree d < n − 1 are also desired. Up to now, only a few (n, k) MSR code constructions with repair degree d < n − 1 have been reported. Some have a large sub-packetization level, a large finite field, or restrictions on the repair degree d. In this paper,

show abstract

Section: Discussionmentioning

confidence: 99%

“…Lemma 3. ( [28, Theorem 2]) Every failed node of the new (n, k) array code C 2 obtained by the generic transformation can be regenerated by the repair matrices defined in (29), the repair bandwidth is (1…”

Section: Theorem 3 the Requirements In Items I) Ii) Of Theorem 1 And ...mentioning

confidence: 99%