Results 1 to 10 of about 921,749 (50)
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
The Space of Solutions of Coupled XORSAT Formulae [PDF]
, 2013 The XOR-satisfiability (XORSAT) problem deals with a system of $n$ Boolean variables and $m$ clauses. Each clause is a linear Boolean equation (XOR) of a subset of the variables. A $K$-clause is a clause involving $K$ distinct variables. In the random $K$
Hassani, S. Hamed +2 more
core +1 more source
A Bit of Information Theory, and the Data Augmentation Algorithm Converges [PDF]
IEEE Transactions on Information Theory 54 (2008) 5186--5188, 2008 The data augmentation (DA) algorithm is a simple and powerful tool in statistical computing. In this note basic information theory is used to prove a nontrivial convergence theorem for the DA algorithm.
arxiv +1 more source
Information Theory and Point Processes [PDF]
arXiv, 2022 This paper addresses theoretically correct vs. incorrect ways to apply information theory to point processes.
arxiv
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
A Simple Derivation of the Refined Sphere Packing Bound Under Certain Symmetry Hypotheses
, 2020 A judicious application of the Berry-Esseen theorem via suitable Augustin information measures is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is $\mathit{\Omega}\left(n^{-0.5(1-E_{sp}'(R))}\right)$ for all ...
Nakiboglu, Baris
core +1 more source
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
Improving compressed sensing with the diamond norm
, 2016 In low-rank matrix recovery, one aims to reconstruct a low-rank matrix from a minimal number of linear measurements. Within the paradigm of compressed sensing, this is made computationally efficient by minimizing the nuclear norm as a convex surrogate ...
Eisert, Jens +3 more
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