Results 11 to 20 of about 1,440,604 (97)
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
6G: The Personal Tactile Internet—And Open Questions for Information Theory
IEEE BITS the Information Theory Magazine, 2021 The initial vision of cellular communications was to deliver ubiquitous voice communications to anyone anywhere. In a simplified view, 1G delivered voice services for business customers, and only 2G for consumers.
G. Fettweis, H. Boche
semanticscholar +1 more source
Journal of Nanomaterials, Volume 2014, Issue 1, 2014., 2014 For a long time the conservation of archaeological artefacts has been based on the principles of compatibility and minimal intervention. This involves a series of partially unsolved problems, concerning the products used for deteriorated structures consolidation.
Andrea Macchia +7 more
wiley +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
Thermodynamics of computation and information distance
Symposium on the Theory of Computing, 1993 Applying the tools of algorithmic information theory, we compare several candidates for an asymptotically machine-independent. absolute measure of the informational or ``cognitive`` distance between discrete objects x and y.
Charles H. Bennett +4 more
semanticscholar +1 more source
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
Information Theory and Point Processes [PDF]
arXiv, 2022 This paper addresses theoretically correct vs. incorrect ways to apply information theory to point processes.
arxiv
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
Privacy Amplification, Lossy Compression, and their Duality to Channel Coding
International Symposium on Information Theory, 2019 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 ...
J. Renes
semanticscholar +1 more source
Group testing: an information theory perspective [PDF]
Foundations and Trends in Communications and Information Theory, 2019 The group testing problem concerns discovering a small number of defective items within a large population by performing tests on pools of items. A test is positive if the pool contains at least one defective, and negative if it contains no defectives ...
Matthew Aldridge +2 more
semanticscholar +1 more source