research
∙
05/09/2023
On the Structure of Higher Order MDS Codes
A code of length n is said to be (combinatorially) (ρ,L)-list decodable ...
share
research
∙
05/08/2023
t-PIR Schemes with Flexible Parameters via Star Products of Berman Codes
We present a new class of private information retrieval (PIR) schemes th...
research
∙
02/07/2023
Cache-Aided Communication Schemes via Combinatorial Designs and their q-analogs
We consider the standard broadcast setup with a single server broadcasti...
research
∙
08/22/2022
Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-based Approach
In pliable index coding (PICOD), a number of clients are connected via a...
research
∙
05/12/2022
Coded Data Rebalancing for Distributed Data Storage Systems with Cyclic Storage
We consider replication-based distributed storage systems in which each ...
research
∙
02/21/2022
Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity
We identify a family of binary codes whose structure is similar to Reed-...
research
∙
02/03/2021
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
In the pliable index coding (PICOD) problem, a server is to serve multip...
research
∙
10/22/2020
Coded Data Rebalancing for Decentralized Distributed Databases
The performance of replication-based distributed databases is affected d...
research
∙
10/20/2020
Blind Updates in Coded Caching
We consider the centralized coded caching system where a library of file...
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/15/2020
Low Complexity Distributed Computing via Binary Matrices with Extension to Stragglers
We consider the distributed computing framework of Map-Reduce, which con...
research
∙
01/14/2020
Coded Data Rebalancing: Fundamental Limits and Constructions
Distributed databases often suffer unequal distribution of data among st...
research
∙
01/02/2020
Subexponential and Linear Subpacketization Coded Caching via Line Graphs and Projective Geometry
Large gains in the rate of cache-aided broadcast communication are obtai...
research
∙
10/19/2019
Locally Decodable Index Codes
An index code for broadcast channel with receiver side information is lo...
research
∙
04/10/2019
Cache-Aided Interference Management with Subexponential Subpacketization
Consider an interference channel consisting of K_T transmitters and K_R ...
research
∙
02/20/2019
Low Subpacketization Coded Caching via Projective Geometry for Broadcast and D2D networks
Coded caching was introduced as a technique of systematically exploiting...
research
∙
01/23/2019
Coded Caching via Projective Geometry: A new low subpacketization scheme
Coded Caching is a promising solution to reduce the peak traffic in broa...
research
∙
01/18/2019
Coded Caching based on Combinatorial Designs
We consider the standard broadcast setup with a single server broadcasti...
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/17/2019
On Index coding for Complementary Graphs with focus on Circular Perfect Graphs
Circular perfect graphs are those undirected graphs such that the circul...
research
∙
05/23/2018
Coded Caching via Line Graphs of Bipartite Graphs
We present a coded caching framework using line graphs of bipartite grap...
research
∙
01/11/2018
