Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given any r and n,  present an explicit construction of high-rate maximum distance separable (MDS) array codes that can optimally repair any d failed nodes from any h helper nodes for all h, 1 ≤ h ≤ r and d, k ≤ d ≤ n − h simultaneously. These codes can be constructed over any base field F as long as |F| ≥ sn; where s = lcm(1, 2, …, r). The encoding, decoding, repair of failed nodes, and update procedures of these codes all have low complexity. Our results present a significant improvement over earlier results which can only construct explicit codes for the case of at most 3 parity nodes, and these existing constructions can only optimally repair a single node failure by accessing all the surviving nodes. In the second part of the paper  give an explicit construction of Reed-Solomon codes with asymptotically optimal repair bandwidth.
['Min Ye', 'Alexander Barg']
I am writing a research paper on a idea Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth
[{"from": "human", "value": "I am writing a research paper on a idea Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given any r and n,  present an explicit construction of high-rate maximum distance separable (MDS) array codes that can optimally repair any d failed nodes from any h helper nodes for all h, 1 \u2264 h \u2264 r and d, k \u2264 d \u2264 n \u2212 h simultaneously. These codes can be constructed over any base field F as long as |F| \u2265 sn; where s = lcm(1, 2, \u2026, r). The encoding, decoding, repair of failed nodes, and update procedures of these codes all have low complexity. Our results present a significant improvement over earlier results which can only construct explicit codes for the case of at most 3 parity nodes, and these existing constructions can only optimally repair a single node failure by accessing all the surviving nodes. In the second part of the paper  give an explicit construction of Reed-Solomon codes with asymptotically optimal repair bandwidth."}]