A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
Work
Year: 2019
Type: article
Abstract: This paper considers the natural extension of locally recoverable codes (LRC) to the case of t > 1 erased symbols. While several approaches have been proposed for the handling of multiple erasures, in... more
Institutions University of California, Santa Barbara, University of Southern California, Indian Institute of Science Bangalore
Cites: 51
Cited by: 8
Related to: 10
FWCI: 1.051
Citation percentile (by year/subfield): 74.75
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder National Science Foundation
Grant ID 1421848