Results 11 to 20 of about 17,086 (201)
In the traditional (K,L,MT,MU,N) partially connected linear network, a central server stores a library of N files and connects to K+L−1 transmitters, each equipped with a cache of size MT.
Yifei Huang, Siying Luo, Bowen Zheng
doaj +2 more sources
A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching [PDF]
In caching system, it is desirable to design a coded caching scheme with the transmission load $R$ and subpacketization $F$ as small as possible, in order to improve efficiency of transmission in the peak traffic times and to decrease implementation complexity. Yan et al. reformulated the centralized coded caching scheme as designing a corresponding $F\
Minquan Cheng +3 more
openaire +2 more sources
Coded Caching for Combination Networks with Multiaccess
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 +1 more source
Coded Caching with Shared Caches from Generalized Placement Delivery Arrays [PDF]
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 decentralized settings under uncoded placement.
Elizabath Peter, B. Sundar Rajan
openaire +2 more sources
Endoscopic Ultrasound-Guided Vascular Therapy: The Present and the Future [PDF]
Endoscopic ultrasound (EUS) offers access to many intra-abdominal vessels that until now have only been accessible to the surgeon and interventional radiologist.
Philip S.J. Hall +3 more
doaj +1 more source
The Optimal Placement Delivery Arrays
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 far, only one class of PDAs by Maddah-Ali and Niesen is known to be optimal.
Cheng, Minquan +4 more
openaire +3 more sources
Some New Coded Caching Schemes With Smaller Subpacketization via Some Known Results
Coded caching is widely regarded as an important tool to reduce pressure on the data transmission during the peak traffic times in heterogeneous wireless networks.
Minquan Cheng, Wenyu Zhang, Jing Jiang
doaj +1 more source
Placement Delivery Arrays from Combinations of Strong Edge Colorings [PDF]
It has recently been pointed out in both of the works [C. Shanguan, Y. Zhang, and G. Ge, {\em IEEE Trans. Inform. Theory}, 64(8):5755-5766 (2018)] and [Q. Yan, X. Tang, Q. Chen, and M. Cheng, {\em IEEE Commun. Lett.}, 22(2):236-239 (2018)] that placement delivery arrays (PDAs), as coined in [Q. Yan, M. Cheng, X. Tang, and Q.
Jerod Michel, Qi Wang 0012
openaire +2 more sources
Placement Delivery Array Design for Combination Networks with Edge Caching [PDF]
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 so-called placement delivery arrays (PDA).
Yan, Qifa, Wigger, Michele, Yang, Sheng
openaire +2 more sources
New coded caching schemes from placement delivery arrays
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 be used to generate coded caching schemes. However, many known coded caching schemes have large memory ratios.
Mingming Zhang 0003 +4 more
openaire +2 more sources

