7.7k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Harish-Chandra Research InstituteIN27 papers
- International Institute of Information TechnologyIN23 papers
- Homi Bhabha National InstituteIN20 papers
- Indian Institute of Science Education and Research ThiruvananthapuramIN20 papers
- Indian Institute of Science BangaloreIN15 papers
- Indian Institute of Technology HyderabadIN14 papers
- Institute of Physics, BhubaneshwarIN11 papers
- Birla Institute of Technology and Science, PilaniIN10 papers
- National University of SingaporeSG9 papers
- Indian Institute of Technology KanpurIN8 papers
- Université Libre de BruxellesBE8 papers
- Birla Institute of Technology and Science - Hyderabad CampusIN7 papers
15 papers · 1 filter
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, and Shuffling
Prasad Krishnan, Lakshmi Natarajan, V. Lalitha
The problem of data exchange between multiple nodes with storage and communication capabilities models several current multi-user communication problems like Coded Caching, Data Sh…
Low Complexity Distributed Computing via Binary Matrices with Extension to Stragglers
Shailja Agrawal, Prasad Krishnan
We consider the distributed computing framework of MapReduce, which consists of three phases, the Map phase, the Shuffle phase and the Reduce phase. For this framework, we propose…
Subexponential and Linear Subpacketization Coded Caching via Projective Geometry
Hari Hara Suthan Chittoor, Prasad Krishnan, K V Sushena Sree +1
Large gains in the rate of cache-aided broadcast communication are obtained using coded caching, but to obtain this most existing centralized coded caching schemes require that the…
Straggler Mitigation with Tiered Gradient Codes
Shanuja Sasi, V. Lalitha, Vaneet Aggarwal +1
Coding theoretic techniques have been proposed for synchronous Gradient Descent (GD) on multiple servers to mitigate stragglers. These techniques provide the flexibility that the j…
On the Polarizing Behavior and Scaling Exponent of Polar Codes with Product Kernels
Manan Bhandari, Ishan Bansal, V. Lalitha
Polar codes, introduced by Arikan, achieve the capacity of arbitrary binary-input discrete memoryless channel under successive cancellation decoding. Any such channel having ca…
Low Subpacketization Coded Caching via Projective Geometry for Broadcast and D2D networks
Hari Hara Suthan Chittoor, Prasad Krishnan
Coded caching was introduced as a technique of systematically exploiting locally available storage at the clients to increase the channel throughput via coded transmissions. Most k…
On Epsilon-MSCR Codes for Two Erasures
Bh. Rekha Devi, V. Lalitha
Cooperative regenerating codes are regenerating codes designed to tradeoff storage for repair bandwidth in case of multiple node failures. Minimum storage cooperative regenerating…
Locality in Index Coding for Large Min-Rank
Lakshmi Natarajan, Hoang Dau, Prasad Krishnan +1
An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols in…
On Maximally Recoverable Codes for Product Topologies
D. Shivakrishna, V. Arvind Rameshwar, V. Lalitha +1
Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct all erasure patterns that are information-theoretically correctable. In a grid-li…
An Improved Secretive Coded Caching Scheme exploiting Common Demands
Hari Hara Suthan C, Ishani Chugh, Prasad Krishnan
Coded caching schemes on broadcast networks with user caches help to offload traffic from peak times to off-peak times by prefetching information from the server to the users durin…
Index Coding: Rank-Invariant Extensions
Vamsi Krishna Gummadi, Ashok Choudhary, Prasad Krishnan
An index coding (IC) problem consisting of a server and multiple receivers with different side-information and demand sets can be equivalently represented using a fitting matrix. A…
Uniprior Index Coding
Vijaya Kumar Mareedu, Prasad Krishnan
The index coding problem is a problem of efficient broadcasting with side-information. We look at the uniprior index coding problem, in which the receivers have disjoint side-infor…
Time Optimal Spectrum Sensing
Garimella Rama Murthy, Rhishi Pratap Singh, Samdarshi Abhijeet +1
Spectrum sensing is a fundamental operation in cognitive radio environment. It gives information about spectrum availability by scanning the bands. Usually a fixed amount of time i…
Spatial Modulation- Spatial Multiplexing in Massive MIMO
Garimella Rama Murthy, Kunal Sankhe
Massive MIMO, a candidate for 5G technology, promises significant gains in wireless data rates and link reliability by using large numbers of antennas (more than 64) at the base tr…
A class of index coding problems with rate 1/3
Prasad Krishnan, V. Lalitha
An index coding problem with messages has symmetric rate if all messages can be conveyed at rate . In a recent work, a class of index coding problems for which symme…