English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This paper considers linear, binary codes having locality parameter r, that are capable of recovering from t &#x2265; 2 erasures and which additionally, possess short block length. Both sequential and parallel (through orthogonal parity checks) recovery are considered. In the case of sequential repair, the results include (a) extending and characterizing minimum-block-length constructions for t = 2, (b) providing improved bounds on block length for t = 3 as well as a general construction for t = 3 having short block length, (c) providing high-rate constructions for (r = 2, t &#x2208; {4, 5, 6, 7}) and (d) providing short-block-length constructions for general (r, t). In the case of parallel repair, minimum-block-length constructions are characterized whenever t|(r<sup>2</sup> + r) and examples examined.

Binary codes with locality for multiple erasures having short block length