# IEEE Transactions on Information Theory

Includes the top 50 most frequently accessed documents for this publication according to the usage statistics for the month of

• ### Compressed sensing

Publication Year: 2006, Page(s):1289 - 1306
Cited by:  Papers (12807)  |  Patents (164)
| | PDF (483 KB) | HTML

Suppose x is an unknown vector in Ropf<sup>m</sup> (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible by transform coding with a known transform, and we reconstruct via the nonlinear procedure defined here, the number of measurements n can be dramatically smaller than the size m. Thus, certain natural... View full abstract»

• ### Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels

Publication Year: 2009, Page(s):3051 - 3073
Cited by:  Papers (1311)  |  Patents (26)
| | PDF (707 KB) | HTML

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel (B-DMC) W. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. Channel polarization refers to the fact that it is possible to synthesize, out of N ind... View full abstract»

• ### Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

Publication Year: 2006, Page(s):489 - 509
Cited by:  Papers (7796)  |  Patents (141)
| | PDF (1167 KB) | HTML

This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal f/spl isin/C/sup N/ and a randomly chosen set of frequencies /spl Omega/. Is it possible to reconstruct f from the partial knowledge of its Fourier coefficients on the set /spl Omega/? A typical result of this paper is as follows. Suppose that f is a superposition o... View full abstract»

• ### Channel Coding Rate in the Finite Blocklength Regime

Publication Year: 2010, Page(s):2307 - 2359
Cited by:  Papers (796)  |  Patents (1)
| | PDF (3873 KB) | HTML

This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight approximations of the maximal achievable rate for blocklengths <i>n</i> as short as 100. It is... View full abstract»

• ### Speeding Up Distributed Machine Learning Using Codes

Publication Year: 2018, Page(s):1514 - 1529
Cited by:  Papers (25)
| | PDF (1461 KB) | HTML

Codes are widely used in many engineering applications to offer robustness against noise. In large-scale systems, there are several types of noise that can affect the performance of distributed machine learning algorithms-straggler nodes, system failures, or communication bottlenecks-but there has been little interaction cutting across codes, machine learning, and distributed systems. In this pape... View full abstract»

• ### List Decoding of Polar Codes

Publication Year: 2015, Page(s):2213 - 2226
Cited by:  Papers (279)
| | PDF (1015 KB) | HTML

We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list decoder, L decoding paths are considered concurrently at each decoding stage, where L is an integer parameter. At the end of the decoding process, the most likely among the L paths is selected as the single codeword at the deco... View full abstract»

• ### Joint Spatial Division and Multiplexing—The Large-Scale Array Regime

Publication Year: 2013, Page(s):6441 - 6463
Cited by:  Papers (540)  |  Patents (4)
| | PDF (6169 KB) | HTML

We propose joint spatial division and multiplexing (JSDM), an approach to multiuser MIMO downlink that exploits the structure of the correlation of the channel vectors in order to allow for a large number of antennas at the base station while requiring reduced-dimensional channel state information at the transmitter (CSIT). JSDM achieves significant savings both in the downlink training and in the... View full abstract»

• ### FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers

Publication Year: 2013, Page(s):8402 - 8413
Cited by:  Papers (447)
| | PDF (2158 KB) | HTML

Video on-demand streaming from Internet-based servers is becoming one of the most important services offered by wireless networks today. In order to improve the area spectral efficiency of video transmission in cellular systems, small cells heterogeneous architectures (e.g., femtocells, WiFi off-loading) are being proposed, such that video traffic to nomadic users can be handled by short-range lin... View full abstract»

• ### A Mathematical Theory of Deep Convolutional Neural Networks for Feature Extraction

Publication Year: 2018, Page(s):1845 - 1866
Cited by:  Papers (9)
| | PDF (905 KB) | HTML

Deep convolutional neural networks (DCNNs) have led to breakthrough results in numerous practical machine learning tasks, such as classification of images in the ImageNet data set, control-policy-learning to play Atari games or the board game Go, and image captioning. Many of these applications first perform feature extraction and then feed the results thereof into a classifier. The mathematical a... View full abstract»

• ### Factor graphs and the sum-product algorithm

Publication Year: 2001, Page(s):498 - 519
Cited by:  Papers (3086)  |  Patents (192)
| | PDF (458 KB) | HTML

Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of "local" functions, each of which depends on a subset of the variables. Such a factorization can be visualized with a bipartite graph that we call a factor graph, In this tutorial paper, we present a generic message-passing algorithm, the sum-pro... View full abstract»

• ### Cooperative diversity in wireless networks: Efficient protocols and outage behavior

Publication Year: 2004, Page(s):3062 - 3080
Cited by:  Papers (8972)  |  Patents (63)
| | PDF (572 KB) | HTML

We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals' relaying signals for one another. We outline several strategies employed by the cooperating radios, including fixed relaying schemes such as amplify-and-forward and ... View full abstract»

• ### Decoding by linear programming

Publication Year: 2005, Page(s):4203 - 4215
Cited by:  Papers (3327)  |  Patents (43)
| | PDF (375 KB) | HTML

This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl isin/R/sup n/ from corrupted measurements y=Af+e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to recover f exactly from the data y? We prove that under suitable conditions on the coding matrix A, the input f is t... View full abstract»

• ### Nearest neighbor pattern classification

Publication Year: 1967, Page(s):21 - 27
Cited by:  Papers (2380)  |  Patents (98)
| | PDF (1019 KB)

The nearest neighbor decision rule assigns to an unclassified sample point the classification of the nearest of a set of previously classified points. This rule is independent of the underlying joint distribution on the sample points and their classifications, and hence the probability of error<tex>R</tex>of such a rule must be at least as great as the Bayes probability of error<tex... View full abstract»

• ### The Optimal Hard Threshold for Singular Values is $4/\sqrt {3}$

Publication Year: 2014, Page(s):5040 - 5053
Cited by:  Papers (68)
| | PDF (2734 KB) | HTML

We consider recovery of low-rank matrices from noisy data by hard thresholding of singular values, in which empirical singular values below a threshold λ are set to 0. We study the asymptotic mean squared error (AMSE) in a framework, where the matrix size is large compared with the rank of the matrix to be recovered, and the signal-to-noise ratio of the low-rank piece stays constant. The AMSE-opti... View full abstract»

• ### Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks

Publication Year: 2019, Page(s):742 - 769
| | PDF (746 KB) | HTML

In this paper, we study the problem of learning a shallow artificial neural network that best fits a training data set. We study this problem in the over-parameterized regime where the numbers of observations are fewer than the number of parameters in the model. We show that with the quadratic activations, the optimization landscape of training, such shallow neural networks, has certain favorable ... View full abstract»

• ### The Age of Information: Real-Time Status Updating by Multiple Sources

Publication Year: 2019, Page(s):1807 - 1827
| | PDF (1244 KB) | HTML

We examine multiple independent sources providing status updates to a monitor through simple queues. We formulate an age of information (AoI) timeliness metric and derive a general result for the AoI that is applicable to a wide variety of multiple source service systems. For first-come first-served and two types of last-come first-served systems with Poisson arrivals and exponential service times... View full abstract»

• ### Fundamental Limits of Caching

Publication Year: 2014, Page(s):2856 - 2867
Cited by:  Papers (576)
| | PDF (784 KB) | HTML

Caching is a technique to reduce peak traffic rates by prefetching popular content into memories at the end users. Conventionally, these memories are used to deliver requested content in part from a locally cached copy rather than through the network. The gain offered by this approach, which we term local caching gain, depends on the local cache size (i.e., the memory available at each individual ... View full abstract»

• ### Polar Coding for Processes With Memory

Publication Year: 2019, Page(s):1994 - 2003
| | PDF (483 KB) | HTML

We study polar coding for stochastic processes with memory. For example, a process may be defined by the joint distribution of the input and output of a channel. The memory may be present in the channel, the input, or both. We show that the ψ-mixing processes polarize under the standard Arıkan transform, under a mild condition. We further show that the rate of polarization of the low-entropy synth... View full abstract»

• ### Subspace Pursuit for Compressive Sensing Signal Reconstruction

Publication Year: 2009, Page(s):2230 - 2249
Cited by:  Papers (1104)  |  Patents (8)
| | PDF (976 KB) | HTML

We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of orthogonal matching pursuit techniques when applied to very sparse signals, and reconstruction accuracy of the same order as that of linear programming (LP) opti... View full abstract»

• ### Network Coding for Distributed Storage Systems

Publication Year: 2010, Page(s):4539 - 4551
Cited by:  Papers (813)  |  Patents (24)
| | PDF (739 KB) | HTML

Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, requires less redundancy than simple replication for the same level of reliability. However, since f... View full abstract»

• ### Massive MIMO Systems With Non-Ideal Hardware: Energy Efficiency, Estimation, and Capacity Limits

Publication Year: 2014, Page(s):7112 - 7139
Cited by:  Papers (334)
| | PDF (2212 KB) | HTML

The use of large-scale antenna arrays can bring substantial improvements in energy and/or spectral efficiency to wireless systems due to the greatly improved spatial resolution and array gain. Recent works in the field of massive multiple-input multiple-output (MIMO) show that the user channels decorrelate when the number of antennas at the base stations (BSs) increases, thus strong signal gains a... View full abstract»

• ### How to Construct Polar Codes

Publication Year: 2013, Page(s):6562 - 6582
Cited by:  Papers (242)  |  Patents (4)
| | PDF (5879 KB) | HTML

A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows exponentially with the code length. Thus, the core problem that needs to be solved is that of faithfully approximating a bit-channel with an intractably large a... View full abstract»

• ### The wavelet transform, time-frequency localization and signal analysis

Publication Year: 1990, Page(s):961 - 1005
Cited by:  Papers (3269)  |  Patents (30)
| | PDF (3699 KB)

Two different procedures for effecting a frequency analysis of a time-dependent signal locally in time are studied. The first procedure is the short-time or windowed Fourier transform; the second is the wavelet transform, in which high-frequency components are studied with sharper time resolution than low-frequency components. The similarities and the differences between these two methods are disc... View full abstract»

• ### Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit

Publication Year: 2012, Page(s):1094 - 1121
Cited by:  Papers (639)  |  Patents (2)
| | PDF (6565 KB) | HTML

Finding the sparsest solution to underdetermined systems of linear equationsy= Φxis NP-hard in general. We show here that for systems with “typical”/“random” Φ, a good approximation to the sparsest solution is obtained by applying a fixed number of standard operations from linear algebra. Our proposal, Stagewise Orthogonal Matching Pursuit (StOMP), successively transforms the sig... View full abstract»

• ### De-noising by soft-thresholding

Publication Year: 1995, Page(s):613 - 627
Cited by:  Papers (4912)  |  Patents (73)
| | PDF (1377 KB)

Donoho and Johnstone (1994) proposed a method for reconstructing an unknown function f on [0,1] from noisy data d/sub i/=f(t/sub i/)+/spl sigma/z/sub i/, i=0, ..., n-1,t/sub i/=i/n, where the z/sub i/ are independent and identically distributed standard Gaussian random variables. The reconstruction f/spl circ/*/sub n/ is defined in the wavelet domain by translating all the empirical wavelet coeffi... View full abstract»

• ### The capacity of low-density parity-check codes under message-passing decoding

Publication Year: 2001, Page(s):599 - 618
Cited by:  Papers (1795)  |  Patents (154)
| | PDF (475 KB) | HTML

We present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chosen element of the given ensemble will achieve an arbitrarily small target probability of error with a probability th... View full abstract»

• ### Update or Wait: How to Keep Your Data Fresh

Publication Year: 2017, Page(s):7492 - 7508
Cited by:  Papers (37)
| | PDF (1178 KB) | HTML

In this paper, we study how to optimally manage the freshness of information updates sent from a source node to a destination via a channel. A proper metric for data freshness at the destination is the age-of-information, or simply age, which is defined as how old the freshest received update is, since the moment that this update was generated at the source node (e.g., a sensor). A reasonable upda... View full abstract»

• ### Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

Publication Year: 2007, Page(s):4655 - 4666
Cited by:  Papers (4355)  |  Patents (39)
| | PDF (936 KB) | HTML

This paper demonstrates theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal. This is a massive improvement over previous results, which require <i>O</i>(m<sup>2</sup>) measurements. The new results for OMP a... View full abstract»

• ### Raptor codes

Publication Year: 2006, Page(s):2551 - 2567
Cited by:  Papers (1578)  |  Patents (60)
| | PDF (529 KB) | HTML

LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper, we introduce Raptor codes, an extension of LT-codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: for a given integer k and any real epsiv&gt;0, Raptor codes in this class produce a potential... View full abstract»

• ### Polar Coding Strategies for the Interference Channel With Partial-Joint Decoding

Publication Year: 2019, Page(s):1973 - 1993
Cited by:  Papers (1)
| | PDF (1145 KB) | HTML

Existing polar coding schemes for the two-user interference channel follow the original idea of Han and Kobayashi, in which component messages are encoded independently and then mapped by some deterministic functions (i.e., homogeneous superposition coding). In this paper, we propose a new polar coding scheme for the interference channel based on the heterogeneous superposition coding approach of ... View full abstract»

• ### Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$ -Constrained Quadratic Programming (Lasso)

Publication Year: 2009, Page(s):2183 - 2202
Cited by:  Papers (307)  |  Patents (1)
| | PDF (732 KB) | HTML

The problem of consistently estimating the sparsity pattern of a vector beta* isin Rp based on observations contaminated by noise arises in various contexts, including signal denoising, sparse approximation, compressed sensing, and model selection. We analyze the behavior of l1-constrained quadratic programming (QP), also referred to as the Lasso, for recovering the sparsity ... View full abstract»

• ### From Denoising to Compressed Sensing

Publication Year: 2016, Page(s):5117 - 5144
Cited by:  Papers (86)
| | PDF (2753 KB) | HTML

A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several decades, and as a result, todays denoisers can effectively remove large amounts of additive white Gaussian noise. A compressed sensing (CS) reconstruction algorithm seeks to recover a structured signal acquired using a small number of randomiz... View full abstract»

• ### Constant Composition Distribution Matching

Publication Year: 2016, Page(s):430 - 434
Cited by:  Papers (96)
| | PDF (600 KB) | HTML

Distribution matching transforms independent and Bernoulli(1/2) distributed input bits into a sequence of output symbols with a desired distribution. Fixed-to-fixed length, invertible, and low complexity encoders and decoders based on constant composition and arithmetic coding are presented. The encoder achieves the maximum rate, namely, the entropy of the desired distribution, asymptotically in t... View full abstract»

• ### Design of capacity-approaching irregular low-density parity-check codes

Publication Year: 2001, Page(s):619 - 637
Cited by:  Papers (2058)  |  Patents (106)
| | PDF (510 KB) | HTML

We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on the work of Richardson and Urbanke (see ibid., vol.47, no.2, p.599-618, 2000). Assuming that the underlying communication chann... View full abstract»

• ### Performance Analysis of ZF and MMSE Equalizers for MIMO Systems: An In-Depth Study of the High SNR Regime

Publication Year: 2011, Page(s):2008 - 2026
Cited by:  Papers (177)
| | PDF (912 KB) | HTML

This paper presents an in-depth analysis of the zero forcing (ZF) and minimum mean squared error (MMSE) equalizers applied to wireless multiinput multioutput (MIMO) systems with no fewer receive than transmit antennas. In spite of much prior work on this subject, we reveal several new and surprising analytical results in terms of output signal-to-noise ratio (SNR), uncoded error and outage probabi... View full abstract»

• ### A Fundamental Tradeoff Between Computation and Communication in Distributed Computing

Publication Year: 2018, Page(s):109 - 128
Cited by:  Papers (26)
| | PDF (1566 KB) | HTML

How can we optimally trade extra computing power to reduce the communication load in distributed computing? We answer this question by characterizing a fundamental tradeoff between computation and communication in distributed computing, i.e., the two are inversely proportional to each other. More specifically, a general distributed computing framework, motivated by commonly used structures like Ma... View full abstract»

• ### Phase Retrieval via Wirtinger Flow: Theory and Algorithms

Publication Year: 2015, Page(s):1985 - 2007
Cited by:  Papers (241)
| | PDF (1664 KB) | HTML

We study the problem of recovering the phase from magnitude measurements; specifically, we wish to reconstruct a complex-valued signal x ∈ ℂnabout which we have phaseless samples of the form yr= |〈ar, x〉|2, r = 1, ..., m (knowledge of the phase of these samples would yield a linear system). This paper develops a nonconvex formulation of the phase retriev... View full abstract»

• ### How much training is needed in multiple-antenna wireless links?

Publication Year: 2003, Page(s):951 - 963
Cited by:  Papers (1354)  |  Patents (33)
| | PDF (832 KB) | HTML

Multiple-antenna wireless communication links promise very high data rates with low error probabilities, especially when the wireless channel response is known at the receiver. In practice, knowledge of the channel is often obtained by sending known training symbols to the receiver. We show how training affects the capacity of a fading channel-too little training and the channel is improperly lear... View full abstract»

• ### A Sampling Theory Perspective of Graph-Based Semi-Supervised Learning

Publication Year: 2019, Page(s):2322 - 2342
| | PDF (1434 KB) | HTML

Graph-based methods have been quite successful in solving unsupervised and semi-supervised learning problems, as they provide a means to capture the underlying geometry of the dataset. It is often desirable for the constructed graph to satisfy two properties: first, data points that are similar in the feature space should be strongly connected on the graph, and second, the class label information ... View full abstract»

• ### Fundamental Limits of Caching in Wireless D2D Networks

Publication Year: 2016, Page(s):849 - 869
Cited by:  Papers (166)
| | PDF (1119 KB) | HTML

We consider a wireless device-to-device (D2D) network where communication is restricted to be single-hop. Users make arbitrary requests from a finite library of files and have pre-cached information on their devices, subject to a per-node storage capacity constraint. A similar problem has already been considered in an infrastructure setting, where all users receive a common multicast (coded) messa... View full abstract»

• ### Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

Publication Year: 2001, Page(s):657 - 670
Cited by:  Papers (669)  |  Patents (55)
| | PDF (334 KB) | HTML

Density evolution is an algorithm for computing the capacity of low-density parity-check (LDPC) codes under message-passing decoding. For memoryless binary-input continuous-output additive white Gaussian noise (AWGN) channels and sum-product decoders, we use a Gaussian approximation for message densities under density evolution to simplify the analysis of the decoding algorithm. We convert the inf... View full abstract»

• ### Mixture Models, Bayes Fisher Information, and Divergence Measures

Publication Year: 2019, Page(s):2316 - 2321
| | PDF (211 KB) | HTML

This paper presents the Bayes Fisher information measures, defined by the expected Fisher information under a distribution for the parameter, for the arithmetic, geometric, and generalized mixtures of two probability density functions. The Fisher information of the arithmetic mixture about the mixing parameter is related to chi-square divergence, Shannon entropy, and the Jensen-Shannon divergence.... View full abstract»

• ### Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

Publication Year: 2003, Page(s):1073 - 1096
Cited by:  Papers (2585)  |  Patents (51)
| | PDF (1620 KB) | HTML

Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. We propose the point of view that both types of gains can be simultaneously obtained for a given multiple-antenna channel, but there is a fundamental tradeoff between how much of each any coding scheme can get. For the richly scattered Rayleigh-fading channel,... View full abstract»

• ### Uncertainty principles and ideal atomic decomposition

Publication Year: 2001, Page(s):2845 - 2862
Cited by:  Papers (946)  |  Patents (30)
| | PDF (624 KB) | HTML

Suppose a discrete-time signal S(t), 0/spl les/t<N, is a superposition of atoms taken from a combined time-frequency dictionary made of spike sequences 1/sub {t=/spl tau/}/ and sinusoids exp{2/spl pi/iwt/N}//spl radic/N. Can one recover, from knowledge of S alone, the precise collection of atoms going to make up S? Because every discrete-time signal can be represented as a superposition of spik... View full abstract»

• ### Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel

Publication Year: 2008, Page(s):3425 - 3441
Cited by:  Papers (2114)  |  Patents (39)
| | PDF (422 KB) | HTML

For the fully connected K user wireless interference channel where the channel coefficients are time-varying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR)=K/2log(SNR)+o(log(SNR)) . Thus, the K user time-varying interference channel almost surely has K/2 degrees of freedom. Achievability is based on the idea of interference alignment. Examples are also pr... View full abstract»

• ### Efficient encoding of low-density parity-check codes

Publication Year: 2001, Page(s):638 - 656
Cited by:  Papers (584)  |  Patents (174)
| | PDF (465 KB) | HTML

Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a similar philosophy: constrained random code ensembles and iterative decoding algorithms. We consider the encoding problem for LDPC codes. More generally we consider the encoding problem for codes specified by sparse parity-check matrices. We show... View full abstract»

• ### Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise

Publication Year: 2011, Page(s):4680 - 4688
Cited by:  Papers (376)  |  Patents (5)
| | PDF (201 KB) | HTML

We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-dimensional sparse signal based on a small number of noisy linear measurements. OMP is an iterative greedy algorithm that selects at each step the column, which is most correlated with the current residuals. In this paper, we present a fully data driven OMP algorithm with explicit stopping rules. It is shown tha... View full abstract»

• ### Cache-Aided Interference Channels

Publication Year: 2019, Page(s):1714 - 1724
| | PDF (647 KB) | HTML

Over the past decade, the bulk of wireless traffic has shifted from speech to content. This shift creates the opportunity to cache part of the content in memories closer to the end users, for example in base stations. Most previous paper focuses on the reduction of load in the backhaul and core networks due to caching, i.e., on the benefits caching offers for the wireline communication link betwee... View full abstract»

• ### Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting

Publication Year: 2012, Page(s):3250 - 3265
Cited by:  Papers (80)
| | PDF (963 KB) | HTML

Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is either sampled from a Gaussian process (GP) or has low norm in a reproducing kernel Hilbert space. We resolve the important open problem of deriving regret bounds for this setting, which imply novel convergence rates for ... View full abstract»

• ### On distances in uniformly random networks

Publication Year: 2005, Page(s):3584 - 3586
Cited by:  Papers (332)
| | PDF (147 KB) | HTML

The distribution of Euclidean distances in Poisson point processes is determined. The main result is the density function of the distance to the n-nearest neighbor of a homogeneous process in Ropf<sup>m</sup>, which is shown to be governed by a generalized Gamma distribution. The result has many implications for large wireless networks of randomly distributed nodes View full abstract»

## Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu