Sciweavers

162 search results - page 6 / 33
» Information theory after Shannon
Sort
View
TIT
2010
107views Education» more  TIT 2010»
13 years 4 months ago
Rate distortion and denoising of individual data using Kolmogorov complexity
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
Nikolai K. Vereshchagin, Paul M. B. Vitányi
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 9 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis
LCN
2006
IEEE
14 years 3 months ago
On Measuring Anonymity For Wireless Mobile Ad-hoc Networks
We propose an evidence theory based anonymity measuring approach for wireless mobile ad-hoc networks. In our approach, an evidence is a measure of the number of detected packets w...
Dijiang Huang
TIT
2008
118views more  TIT 2008»
13 years 8 months ago
Discrete-Input Two-Dimensional Gaussian Channels With Memory: Estimation and Information Rates Via Graphical Models and Statisti
Abstract--Discrete-input two-dimensional (2-D) Gaussian channels with memory represent an important class of systems, which appears extensively in communications and storage. In sp...
Ori Shental, Noam Shental, Shlomo Shamai, Ido Kant...
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 10 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff