English
Related papers

Related papers: Placement Delivery Arrays for Coded Caching with S…

200 papers

This work considers the coded caching problem with shared caches, where users share the caches, and each user gets access only to one cache. The user-to-cache association is assumed to be known at the server during the placement phase. We…

Information Theory · Computer Science 2022-01-28 Elizabath Peter , K. K. Krishnan Namboodiri , B. Sundar Rajan

Coded caching scheme originally proposed by Maddah-Ali and Niesen (MN) achieves an optimal transmission rate $R$ under uncoded placement but requires a subpacketization level $F$ which increases exponentially with the number of users $K$…

Information Theory · Computer Science 2024-02-27 Rashid Ummer N. T. , B. Sundar Rajan

Coded caching is an emerging technique to reduce the data transmission load during the peak-traffic times. In such a scheme, each file in the data center or library is usually divided into a number of packets to pursue a low broadcasting…

Information Theory · Computer Science 2022-01-06 Xianzhang Wu , Minquan Cheng , Congduan Li , Li Chen

Caching is a promising solution to satisfy the ever increasing demands for the multi-media traffics. In caching networks, coded caching is a recently proposed technique that achieves significant performance gains over the uncoded caching…

Information Theory · Computer Science 2017-10-23 Qifa Yan , Minquan Cheng , Xiaohu Tang , Qingchun Chen

In an $(H,r)$ combination network, a single content library is delivered to ${H\choose r}$ users through deployed $H$ relays without cache memories, such that each user with local cache memories is simultaneously served by a different…

Information Theory · Computer Science 2019-10-25 Minquan Cheng , Yiqun Li , Xi Zhong , Ruizhong Wei

Coded caching scheme originally proposed by Maddah-Ali and Niesen (MN) considered a broadcast network consisting of a single server connected to a set of users each having a cache memory. Motivated by practical scenarios, Karamchandani…

Information Theory · Computer Science 2025-04-29 Rashid Ummer N. T. , B. Sundar Rajan

We consider the coded caching problem with shared caches where several users share a cache, but each user has access to only a single cache. For this network, the fundamental limits of coded caching are known for centralized and…

Information Theory · Computer Science 2021-07-02 Elizabath Peter , B. Sundar Rajan

A decentralized coded caching scheme has been proposed by Maddah-Ali and Niesen, and has been shown to alleviate the load of networks. Recently, placement delivery array (PDA) was proposed to characterize the coded caching scheme. In this…

Information Theory · Computer Science 2018-05-03 Zhengming Zhang , Meng Hua , Chunguo Li , Yongming Huang , Luxi Yang

This paper considers the secretive coded caching problem with shared caches in which no user must have access to the files that it did not demand. In a shared cache network, the users are served by a smaller number of helper caches and each…

Information Theory · Computer Science 2021-10-22 Elizabath Peter , K. K. Krishnan Namboodiri , B. Sundar Rajan

A major practical limitation of the Maddah-Ali-Niesen coded caching techniques is their high subpacketization level. For the simple network with a single server and multiple users, Yan \emph{et al.} proposed an alternative scheme with the…

Information Theory · Computer Science 2020-01-23 Qifa Yan , Michèle Wigger , Sheng Yang

This work studies the coded caching problem in a setting where the users are simultaneously endowed with a private cache and a shared cache. The setting consists of a server connected to a set of users, assisted by a smaller number of…

Information Theory · Computer Science 2024-03-26 Elizabath Peter , K. K. Krishnan Namboodiri , B. Sundar Rajan

Coded caching is an efficient way to reduce network traffic congestion during peak hours by storing some content at the user's local cache memory without knowledge of later demands. The goal of coded caching design is to minimize the…

Information Theory · Computer Science 2020-05-05 Minquan Cheng , Dequan Liang , Ruizhong Wei

This paper considers a hierarchical caching system where a server connects with multiple mirror sites, each connecting with a distinct set of users, and both the mirror sites and users are equipped with caching memories. Although there…

Information Theory · Computer Science 2022-09-27 Yun Kong , Youlong Wu , Minquan Cheng

In wireless networks, coded caching is an effective technique to reduce network congestion during peak traffic times. Recently, a new concept called placement delivery array (PDA) was proposed to characterize the coded caching scheme. So…

Information Theory · Computer Science 2017-01-10 Minquan Cheng , Jing Jiang , Qifa Yan , Xiaohu Tang , Haitao Cao

Cache-aided content delivery is studied in a multi-server system with $P$ servers and $K$ users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any $\rho$ out of $P$ servers. Thanks to the…

Information Theory · Computer Science 2020-03-12 Nitish Mital , Deniz Gunduz , Cong Ling

Coded caching scheme, which is an effective technique to increase the transmission efficiency during peak traffic times, has recently become quite popular among the coding community. Generally rate can be measured to the transmission in the…

Information Theory · Computer Science 2017-10-03 Minquan Cheng , Qifa Yan , Xiaohu Tang , Jing Jiang

Coded caching schemes with low subpacketization and small transmission rate are desirable in practice due to the requirement of low implementation complexity and efficiency of the transmission. Placement delivery arrays (PDA in short) can…

Information Theory · Computer Science 2020-08-25 Mingming Zhang , Minquan Cheng , Jinyu Wang , Xi Zhong , Yishan Chen

Caching is an efficient technique to reduce peak traffic by storing popular content in local caches. Placement delivery array (PDA) proposed by Yan et al. is a combinatorial structure to design coded caching schemes with uncoded placement…

Information Theory · Computer Science 2025-01-22 Jinyu Wang , Minquan Cheng , Kai Wan , Giuseppe Caire

The multi-antenna coded caching problem, where the server having $L$ transmit antennas communicating to $K$ users through a wireless broadcast link, is addressed. In the problem setting, the server has a library of $N$ files, and each user…

Information Theory · Computer Science 2022-01-27 K. K. Krishnan Namboodiri , Elizabath Peter , B. Sundar Rajan

This work studies the $K$-user broadcast channel with $\Lambda$ caches, when the association between users and caches is random, i.e., for the scenario where each user can appear within the coverage area of -- and subsequently is assisted…

Information Theory · Computer Science 2021-12-30 Adeel Malik , Berksan Serbetci , Petros Elia
‹ Prev 1 2 3 10 Next ›