Abstract
An (n = 2k + s,k) Suh–Ramchandran code is shown, where s > 0 is a positive integer, is a minimum storage regeneration code, and can also achieve the optimal repair bandwidth for multiple systematic nodes failure repair.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have