Results 1 to 10 of about 4,227 (27)
Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off [PDF]
, 2016 A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered.
Amiri, Mohammad Mohammadi, Gunduz, Deniz
core +2 more sources
Capacity per Unit-Energy of Gaussian Random Many-Access Channels [PDF]
, 2020 We consider a Gaussian multiple-access channel with random user activity where the total number of users $\ell_n$ and the average number of active users $k_n$ may be unbounded.
Koch, Tobias, Ravi, Jithin
core +2 more sources
Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing [PDF]
, 2011 The replica method is a non-rigorous but well-known technique from statistical physics used in the asymptotic analysis of large, random, nonlinear problems.
Fletcher, Alyson K. +2 more
core +3 more sources
Coded Caching for Delay-Sensitive Content [PDF]
, 2014 Coded caching is a recently proposed technique that achieves significant performance gains for cache networks compared to uncoded caching schemes.
Maddah-Ali, Mohammad Ali, Niesen, Urs
core +1 more source
On the Degrees of freedom of the K-user MISO Interference Channel with imperfect delayed CSIT [PDF]
, 2014 This work investigates the degrees of freedom (DoF) of the K-user multiple-input single-output (MISO) interference channel (IC) with imperfect delayed channel state information at the transmitters (dCSIT).
Agustin, Adrian +2 more
core +1 more source
MacWilliams Identities for Terminated Convolutional Codes [PDF]
, 2010 Shearer and McEliece [1977] showed that there is no MacWilliams identity for the free distance spectra of orthogonal linear convolutional codes. We show that on the other hand there does exist a MacWilliams identity between the generating functions of ...
Forney Jr, G. David
core +1 more source
On privacy amplification, lossy compression, and their duality to channel coding
, 2018 We examine the task of privacy amplification from information-theoretic and coding-theoretic points of view. In the former, we give a one-shot characterization of the optimal rate of privacy amplification against classical adversaries in terms of the ...
Renes, Joseph M.
core +1 more source
Coded Caching for a Large Number Of Users
, 2016 Information theoretic analysis of a coded caching system is considered, in which a server with a database of N equal-size files, each F bits long, serves K users.
Amiri, Mohammad Mohammadi +2 more
core +1 more source
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff [PDF]
, 2014 Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the main performance gain of this caching was thought to result from making part of the requested data ...
Maddah-Ali, Mohammad Ali, Niesen, Urs
core +1 more source
Codes between MBR and MSR Points with Exact Repair Property
, 2013 In this paper distributed storage systems with exact repair are studied. A construction for regenerating codes between the minimum storage regenerating (MSR) and the minimum bandwidth regenerating (MBR) points is given. To the best of author's knowledge,
Ernvall, Toni
core +1 more source