research
∙
05/07/2021
Maximally Recoverable Codes with Hierarchical Locality: Constructions and Field-Size Bounds
Maximally recoverable codes are a class of codes which recover from all ...
share
research
∙
02/24/2021
Rack-Aware Cooperative Regenerating Codes
In distributed storage systems, cooperative regenerating codes tradeoff ...
research
∙
02/19/2021
On Gradient Coding with Partial Recovery
We consider a generalization of the recently proposed gradient coding fr...
research
∙
11/11/2020
Secure Regenerating Codes for Reducing Storage and Bootstrap Costs in Sharded Blockchains
Blockchain is a distributed ledger with wide applications. Due to the in...
research
∙
10/20/2020
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, Shuffling Rebalancing
The problem of data exchange between multiple nodes with (not necessaril...
research
∙
01/14/2020
Coded Data Rebalancing: Fundamental Limits and Constructions
Distributed databases often suffer unequal distribution of data among st...
research
∙
10/19/2019
Locally Decodable Index Codes
An index code for broadcast channel with receiver side information is lo...
research
∙
09/05/2019
Straggler Mitigation with Tiered Gradient Codes
Coding theoretic techniques have been proposed for synchronous Gradient ...
research
∙
04/18/2019
On the Scaling Exponent of Polar Codes with Product Kernels
Polar codes, introduced by Arikan, achieve the capacity of arbitrary bin...
research
∙
01/18/2019
On Epsilon-MSCR Codes for Two Erasures
Cooperative regenerating codes are regenerating codes designed to tradeo...
research
∙
01/17/2019
Locality in Index Coding for Large Min-Rank
An index code is said to be locally decodable if each receiver can decod...
research
∙
01/09/2019
Maximally Recoverable Codes with Hierarchical Locality
Maximally recoverable codes are a class of codes which recover from all ...
research
∙
01/11/2018
On Locally Decodable Index Codes
Index coding achieves bandwidth savings by jointly encoding the messages...
research
∙
01/10/2018
