Results 1  10
of
639,357
An InformationTheoretic Upper Bound on the Length of the Shortest Proof
"... Consider a short theorem, i.e. one that can be written down using just a few symbols. Can its shortest proof be arbitrarily long? We answer this question in the negative. Inspired by arguments by Calude et al (1999) and Chaitin (1984) that construct an upper bound on the first counterexample of a Π1 ..."
Abstract
 Add to MetaCart
Consider a short theorem, i.e. one that can be written down using just a few symbols. Can its shortest proof be arbitrarily long? We answer this question in the negative. Inspired by arguments by Calude et al (1999) and Chaitin (1984) that construct an upper bound on the first counterexample of a Π
An InformationTheoretic Upper Bound on Planar Graphs Using WellOrderly Maps
, 2011
"... This chapter deals with compressed coding of graphs. We focus on planar graphs, a widely studied class of graphs. A planar graph is a graph that admits an embedding in the plane without edge crossings. Planar maps (class of embeddings of a planar graph) are easier to study than planar graphs, but a ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
, but as a planar graph may admit an exponential number of maps, they give little information on graphs. In order to give an informationtheoretic upper bound on planar graphs, we introduce a definition of a quasicanonical embedding for planar graphs: wellorderly maps. This appears to be an useful tool
Information theoretical upper and lower bounds for statistical estimation
 IEEE Transaction on Information Theory
"... Abstract — We establish upper and lower bounds for some statistical estimation problems through concise information theoretical arguments. Our upper bound analysis is based on a simple yet general inequality which we call the information exponential inequality. We show that this inequality naturally ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
Abstract — We establish upper and lower bounds for some statistical estimation problems through concise information theoretical arguments. Our upper bound analysis is based on a simple yet general inequality which we call the information exponential inequality. We show that this inequality
Information Theoretic Upper Bound on the Capacity of Wireless Backhaul Networks
"... Abstract—We derive an information theoretic upper bound on the capacity of a wireless backhaul network modeled as a classical random extended network, except that we assume the number of antennas at each base station (BS) also scales up as an arbitrary function of network size. The antenna scaling i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—We derive an information theoretic upper bound on the capacity of a wireless backhaul network modeled as a classical random extended network, except that we assume the number of antennas at each base station (BS) also scales up as an arbitrary function of network size. The antenna scaling
Informationtheoretic upper bounds on the capacity of large extended ad hoc wireless networks
 IEEE Trans. on Information Theory
, 2005
"... Abstract—We derive an informationtheoretic upper bound on the rate per communication pair in a large ad hoc wireless network. We show that under minimal conditions on the attenuation due to the environment and for networks with a constant density of users, this rate tends to zero as the number of u ..."
Abstract

Cited by 68 (2 self)
 Add to MetaCart
Abstract—We derive an informationtheoretic upper bound on the rate per communication pair in a large ad hoc wireless network. We show that under minimal conditions on the attenuation due to the environment and for networks with a constant density of users, this rate tends to zero as the number
Fading Channels: InformationTheoretic And Communications Aspects
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... In this paper we review the most peculiar and interesting informationtheoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus on the information ..."
Abstract

Cited by 416 (3 self)
 Add to MetaCart
In this paper we review the most peculiar and interesting informationtheoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus
An InformationTheoretic Model for Steganography
, 1998
"... An informationtheoretic model for steganography with passive adversaries is proposed. The adversary's task of distinguishing between an innocentcover message C and a modified message S containing a secret part is interpreted as a hypothesis testing problem. The security of a steganographic sys ..."
Abstract

Cited by 267 (3 self)
 Add to MetaCart
An informationtheoretic model for steganography with passive adversaries is proposed. The adversary's task of distinguishing between an innocentcover message C and a modified message S containing a secret part is interpreted as a hypothesis testing problem. The security of a steganographic
Results 1  10
of
639,357