This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the complete list of possible localities is derived for a class of codes obtained by deleting specific columns from a Simplex code. This list is used to show that these codes are optimal codes with hierarchical locality.Peer reviewe
A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword symbo...
An index code is said to be locally decodable if each receiver can decode its demand using its side ...
The problem of storing permutations in a distributed manner arises in several common scenarios, such...
This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the c...
This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the c...
In this paper, we study the notion of codes with hierarchical locality that is identified as another...
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the va...
Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting ...
In this work, we show that the submachine locality exposed by hierarchical bulksynchronous computati...
In this paper, we study codes with locality that can recover from two erasures via a sequence of two...
Researchers have proposed several data and computation transformations to improve locality in irregu...
In this paper, we study codes with locality that can recover from two erasures via a sequence of two...
textabstractLike classical block codes, a locally repairable code also obeys the Singleton-type boun...
An index code for a broadcast channel with receiver side information is locally decodable if every r...
A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword symbo...
An index code is said to be locally decodable if each receiver can decode its demand using its side ...
The problem of storing permutations in a distributed manner arises in several common scenarios, such...
This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the c...
This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the c...
In this paper, we study the notion of codes with hierarchical locality that is identified as another...
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the va...
Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting ...
In this work, we show that the submachine locality exposed by hierarchical bulksynchronous computati...
In this paper, we study codes with locality that can recover from two erasures via a sequence of two...
Researchers have proposed several data and computation transformations to improve locality in irregu...
In this paper, we study codes with locality that can recover from two erasures via a sequence of two...
textabstractLike classical block codes, a locally repairable code also obeys the Singleton-type boun...
An index code for a broadcast channel with receiver side information is locally decodable if every r...
A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword symbo...
An index code is said to be locally decodable if each receiver can decode its demand using its side ...
The problem of storing permutations in a distributed manner arises in several common scenarios, such...