20 papers
Function-Correcting Partition Codes
Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1
We introduce function-correcting partition codes (FCPCs), which are a natural generalization of function-correcting codes (FCCs). An FCPC is defined directly on a partition of the…
Coded Caching for Combinatorial Multi-Access Hotplug Networks from -Designs
Dhruv Pratap Singh, Anjana A. Mahesh, B. Sundar Rajan
We study hotplug coded caching in combinatorial multi-access networks, which generalizes existing hotplug coded caching models by allowing users to access multiple caches, while on…
Function Correcting Codes for Maximally-Unbalanced Boolean Functions
Rajlaxmi Pandey, Shiven Bajpai, Anjana A Mahesh +1
Function-Correcting Codes (FCCs) enable reliable computation of a function of a -bit message over noisy channels without requiring full message recovery. In this work, we study…
Function-Correcting Codes With Data Protection
Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1
Function-correcting codes (FCCs) are designed to provide error protection for the value of a function computed on the data. Existing work typically focuses solely on protecting the…
Secretive Hotplug Coded Caching
Mallikharjuna Chinnapadamala, Charul Rajput, B. Sundar Rajan
In this work, we consider a coded caching model called \textit{hotplug coded caching}, in which some users are offline during the delivery phase. The concept of Hotplug Placement D…
On Hierarchical Coded Caching with Offline Users
Rashid Ummer N. T., B. Sundar Rajan
This paper studies a two-layer hierarchical network in which some users are offline during the content delivery phase. A two-layer hierarchical network consists of a single server…
Function-Correcting Codes for Locally Bounded Functions
Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1
In this paper, we introduce a class of functions that assume only a limited number of values within a given Hamming -ball and call them locally -bounded functions. W…
Hierarchical Coded Caching in High Memory Regime with Coded Placement
Rajlaxmi Pandey, Charul Rajput, B. Sundar Rajan
We consider a two-layer hierarchical coded caching network where a server with a library of files is connected to mirrors, each having a cache memory of size . Each…
D2D Coded Caching from Two Classes of Optimal DPDAs using Cross Resolvable Designs
Rashid Ummer N. T., B. Sundar Rajan
Device to device (D2D) communication is one of the most promising techniques for fifth-generation and beyond wireless communication systems. This paper considers coded caching in a…
Single-Server Pliable Private Information Retrieval with Identifiable Side Information
Megha Rayer, Charul Rajput, B. Sundar Rajan
In Pliable Private Information Retrieval (PPIR) with a single server, messages are partitioned into non-overlapping classes. The user wants to retrieve a message from its desir…
A New Hotplug Coded Caching Scheme Using PDAs
Mallikharjuna Chinnapadamala, Charul Rajput, B. Sundar Rajan
In the original coded caching model introduced by Maddah-Ali and Niesen in 2014, the server starts broadcasting only after it receives demands from all the users. So, all the users…
Optimal Placement Delivery Arrays from -Designs with Application to Hierarchical Coded Caching
Rashid Ummer N. T., B. Sundar Rajan
Coded caching scheme originally proposed by Maddah-Ali and Niesen (MN) achieves an optimal transmission rate under uncoded placement but requires a subpacketization level w…
Multi-access Distributed Computing Models from Map-Reduce Arrays
Shanuja Sasi, Onur Günlü, B. Sundar Rajan
A novel distributed computing model called "Multi-access Distributed Computing (MADC)" was recently introduced in http://www.arXiv:2206.12851. In this paper, we represent MADC mode…
Coded Caching for Hierarchical Two-Layer Networks with Coded Placement
Rajlaxmi Pandey, Charul Rajput, B. Sundar Rajan
We examine a two-layered hierarchical coded caching problem, a configuration addressed in existing research. This involves a server connected to mirrors, each of which serves…
Improved Hotplug Caching Schemes Using PDAs and t-Designs
Charul Rajput, B. Sundar Rajan
We consider a coded caching system in which some users are offline at the time of delivery. Such systems are called hotplug coded caching systems. A placement delivery array (PDA)…
Secretive Coded Caching with Shared Caches
Shreya Shrestha Meel, B. Sundar Rajan
We consider the problem of \emph{secretive coded caching} in a shared cache setup where the number of users accessing a particular \emph{helper cache} is more than one, and every u…
Maddah-Ali-Niesen Scheme for Multi-access Coded Caching
Pooja Nayak Muralidhar, Digvijay Katyal, B. Sundar Rajan
The well known Maddah-Ali-Niesen (MAN) coded caching scheme for users with dedicated cache is extended for use in multi-access coded cache scheme where the number of users need not…
On the Optimal Broadcast Rate of the Two-Sender Unicast Index Coding Problem with Fully-Participated Interactions
Chinmayananda Arunachala, Vaneet Aggarwal, B. Sundar Rajan
The problem of two-sender unicast index coding consists of two senders and a set of receivers. Each receiver demands a unique message and possesses some of the messages demanded by…
Index Codes for Interlinked Cycle Structures with Outer Cycles
K. Vikas Bharadwaj, B. Sundar Rajan
Index code construction for a class of side-information graphs called interlinked cycle (IC) structures without outer cycles is given by Thapa, Ong and Johnson (C. Thapa, L. Ong, a…
Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching
Nujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan
Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be err…