Abstract
An erasure code is said to be a code with sequential recovery with parameters $r$ and t, if for any $s$ ≤ $t$ erased code symbols, there is an s-step recovery process in which at each step we recover exactly one erased code symbol by contacting at most $r$ other code symbols. In this paper, we give a construction of binary codes with sequential recovery that are rate-optimal for any value of $t$ and any value $r$ ≥ 3. Our construction is based on construction of certain kind of tree-like graphs with girth $t$ + 1. We construct these graphs and hence the codes recursively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
