Results 11 to 20 of about 481 (210)
A Coded Caching Scheme with Linear Sub-packetization and its Application to Multi-Access Coded Caching [PDF]
2020 IEEE Information Theory Workshop (ITW), 2021 7 pages, 1 ...
B Sundar Rajan
exaly +4 more sources
On the Placement Delivery Array Design for Centralized Coded Caching Scheme [PDF]
IEEE Transactions on Information Theory, 2017 21 pages, 2 ...
Qifa Yan, Minquan Cheng, Xiaohu Tang
exaly +4 more sources
An improved secretive coded caching scheme exploiting common demands [PDF]
2017 IEEE Information Theory Workshop (ITW), 2017 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 during off-peak times and thus serving the users more efficiently during peak times using coded transmissions.
Prasad Krishnan
exaly +4 more sources
A New Hotplug Coded Caching Scheme Using PDAs
2024 IEEE Information Theory Workshop (ITW)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 must be active during the delivery phase. In this work, we consider a coded caching model called hotplug coded caching in which some of the users are offline during the ...
Mallikharjuna Chinnapadamala +1 more
exaly +5 more sources
A Multi-Antenna Coded Caching Scheme with Linear Subpacketization [PDF]
ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020 6 ...
Mohammad Javad Salehi +2 more
core +6 more sources
Coded Caching for Combination Networks with Multiaccess
Information, 2022 In a traditional (H,r) combination network, each user connects to a unique set of r relays. However, few research efforts have considered the (H,r,u) multiaccess combination network problem wherein each unique set of r relays is connected by u users.
Leitang Huang +4 more
doaj +2 more sources
A Novel Coded Caching Scheme with Coded Prefetching [PDF]
2018 IEEE International Symposium on Information Theory (ISIT), 2018 For the caching problem, when the number of files is no larger than that of users, the best known rate-memory region is achieved by memory sharing between the rate-memory pairs obtained by three schemes: the scheme proposed by Yu et al., the scheme proposed by Gomez-Vilardebo and the scheme proposed by Tian-Chen.
Gómez-Vilardebó, Jesús +1 more
openaire +3 more sources
Hierarchical Cache-Aided Networks for Linear Function Retrieval [PDF]
EntropyIn a hierarchical caching system, a server is connected to multiple mirrors, each of which is connected to a different set of users, and both the mirrors and the users are equipped with caching memories.
Lingyu Zhang +3 more
doaj +2 more sources
Combination Network with Multiaccess Caching [PDF]
EntropyIn the traditional (H,r,M,N) combination network, a central server storing N files communicates with K=(Hr) users through H cache-less relays. Each user has a local cache of size M files and is connected to a distinct subset of r relays.
Bowen Zheng, Yifei Huang, Dianhua Wu
doaj +2 more sources
Towards Characterizing the Download Cost of Cache-Aided Private Updating [PDF]
EntropyWe consider the problem of privately updating a message out of K messages from N replicated and non-colluding databases where a user has an outdated version of the message W^θ of length L bits that differ from the current version Wθ in at most f bits ...
Bryttany Stark +2 more
doaj +2 more sources