34 citations · 50 across the 24 of their papers we have counts for
30 papers
A Hypergraph based lower bound on Pliable Index Coding based on Nested Side-Information Sets
Tulasi Sowjanya B., Prasad Krishnan
In pliable index coding (PICOD), a number of clients are connected via a noise-free broadcast channel to a server which has a list of messages. Each client has a unique subset of m…
Sun-Jafar-Type Schemes for Weak Private Information Retrieval
Chandan Anand, Jayesh Seshadri, Prasad Krishnan +1
In information-theoretic private information retrieval (PIR), a client wants to retrieve one desired file out of files, stored across servers, while keeping the index of th…
On the Structure of Higher Order MDS Codes
Harshithanjani Athi, Rasagna Chigullapally, Prasad Krishnan +1
A code of length is said to be (combinatorially) -list decodable if the Hamming ball of radius around any vector in the ambient space does not contain more than …
-PIR Schemes with Flexible Parameters via Star Products of Berman Codes
Srikar Kale, Keshav Agarwal, Prasad Krishnan
We present a new class of private information retrieval (PIR) schemes that keep the identity of the file requested private in the presence of at most colluding servers, based o…
Cache-Aided Communication Schemes via Combinatorial Designs and their -analogs
Shailja Agrawal, K V Sushena Sree, Prasad Krishnan +2
We consider the standard broadcast setup with a single server broadcasting information to a number of clients, each of which contains local storage (called cache) of some size, whi…
Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-based Approach
Tulasi Sowjanya B., Visvesh Subramanian, Prasad Krishnan
In pliable index coding (PICOD), a number of clients are connected via a noise-free broadcast channel to a server which has a list of messages. Each client has a unique subset of m…