File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TIT.2017.2711611
- Scopus: eid_2-s2.0-85045987349
- WOS: WOS:000430747100019
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: On Sequential Locally Repairable Codes
Title | On Sequential Locally Repairable Codes |
---|---|
Authors | |
Keywords | Distributed storage Locally repairable codes Parallel recovery Sequential recovery |
Issue Date | 2018 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?puNumber=18 |
Citation | IEEE Transactions on Information Theory, 2018, v. 64 n. 5, p. 3513-3527 How to Cite? |
Abstract | We consider the locally repairable codes (LRCs), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called (n, k, r, t)-sequential LRCs (SLRC) as an [n, k] linear code, where any t' (≤ t) erasures can be sequentially recovered, each by r (2 ≤ r <; k) other code symbols. Here, sequential recovering means that the erased symbols are recovered one by one, and an already recovered symbol can be used to recover the remaining erased symbols. This important recovering method, in contrast with the extensively studied parallel recovering, is currently far from being thoroughly understood; more specifically, there are to date no codes constructed for arbitrary t ≥ 3 erasures and bounds to evaluate the performance of such codes. We first derive a tight upper bound on the code rate of the (n, k, r, t)-SLRC for t = 3 and r ≥ 2. We then propose two constructions of binary (n, k, r, t)-SLRCs for general r, t ≥ 2 (existing constructions only deal with t ≤7 erasures). The first construction generalizes the method of direct product construction. The second construction is based on the resolvable configurations and yields SLRCs for any r ≥ 2 odd t ≥ 3. For both constructions, the rates are optimal for t ∈ {2, 3} and are higher than most of the existing LRC families for arbitrary t ≥ 4. |
Persistent Identifier | http://hdl.handle.net/10722/258608 |
ISSN | 2023 Impact Factor: 2.2 2023 SCImago Journal Rankings: 1.607 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Song, W | - |
dc.contributor.author | Cai, K | - |
dc.contributor.author | Yuen, C | - |
dc.contributor.author | Cai, K | - |
dc.contributor.author | Han, G | - |
dc.date.accessioned | 2018-08-22T01:41:13Z | - |
dc.date.available | 2018-08-22T01:41:13Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | IEEE Transactions on Information Theory, 2018, v. 64 n. 5, p. 3513-3527 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | http://hdl.handle.net/10722/258608 | - |
dc.description.abstract | We consider the locally repairable codes (LRCs), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called (n, k, r, t)-sequential LRCs (SLRC) as an [n, k] linear code, where any t' (≤ t) erasures can be sequentially recovered, each by r (2 ≤ r <; k) other code symbols. Here, sequential recovering means that the erased symbols are recovered one by one, and an already recovered symbol can be used to recover the remaining erased symbols. This important recovering method, in contrast with the extensively studied parallel recovering, is currently far from being thoroughly understood; more specifically, there are to date no codes constructed for arbitrary t ≥ 3 erasures and bounds to evaluate the performance of such codes. We first derive a tight upper bound on the code rate of the (n, k, r, t)-SLRC for t = 3 and r ≥ 2. We then propose two constructions of binary (n, k, r, t)-SLRCs for general r, t ≥ 2 (existing constructions only deal with t ≤7 erasures). The first construction generalizes the method of direct product construction. The second construction is based on the resolvable configurations and yields SLRCs for any r ≥ 2 odd t ≥ 3. For both constructions, the rates are optimal for t ∈ {2, 3} and are higher than most of the existing LRC families for arbitrary t ≥ 4. | - |
dc.language | eng | - |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?puNumber=18 | - |
dc.relation.ispartof | IEEE Transactions on Information Theory | - |
dc.rights | IEEE Transactions on Information Theory. Copyright © IEEE. | - |
dc.subject | Distributed storage | - |
dc.subject | Locally repairable codes | - |
dc.subject | Parallel recovery | - |
dc.subject | Sequential recovery | - |
dc.title | On Sequential Locally Repairable Codes | - |
dc.type | Article | - |
dc.identifier.email | Cai, K: kcai@hku.hk | - |
dc.identifier.email | Han, G: ghan@hku.hk | - |
dc.identifier.authority | Han, G=rp00702 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/TIT.2017.2711611 | - |
dc.identifier.scopus | eid_2-s2.0-85045987349 | - |
dc.identifier.hkuros | 287301 | - |
dc.identifier.volume | 64 | - |
dc.identifier.issue | 5 | - |
dc.identifier.spage | 3513 | - |
dc.identifier.epage | 3527 | - |
dc.identifier.isi | WOS:000430747100019 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 0018-9448 | - |