# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 31

Publication Year: 2016, Page(s):C1 - C4
| PDF (361 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2016, Page(s): C2
| PDF (194 KB)
• ### Types of Markov Fields and Tilings

Publication Year: 2016, Page(s):4361 - 4375
Cited by:  Papers (1)
| | PDF (1027 KB) | HTML

The method of types is one of the most popular techniques in information theory and combinatorics. However, thus far the method has been mostly applied to 1-D Markov processes, and it has not been thoroughly studied for general Markov fields. Markov fields over a finite alphabet of size m ≥ 2 can be viewed as models for multidimensional systems with local interactions. The locality of these intera... View full abstract»

• ### A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels

Publication Year: 2016, Page(s):4376 - 4394
Cited by:  Papers (5)
| | PDF (419 KB) | HTML

We prove the strong converse for the N -source Gaussian multiple access channel. In particular, we show that any rate tuple that can be supported by a sequence of codes with asymptotic average error probability &lt;;1 must lie in the Cover-Wyner capacity region. Our proof consists of the following. First, we perform an expurgation step to convert any given sequence of codes with asymptotic ave... View full abstract»

• ### First- and Second-Order Coding Theorems for Mixed Memoryless Channels With General Mixture

Publication Year: 2016, Page(s):4395 - 4412
Cited by:  Papers (4)
| | PDF (348 KB) | HTML

This paper investigates the first- and second-order maximum achievable rates of codes with/without cost constraints for mixed channels whose channel law is characterized by a general mixture of (at most) uncountably many stationary and memoryless discrete channels. These channels are referred to as mixed memoryless channels with general mixture and include the class of mixed memoryless channels of... View full abstract»

• ### A Geometric Analysis of the AWGN Channel With a$(\sigma , \rho )$-Power Constraint

Publication Year: 2016, Page(s):4413 - 4438
Cited by:  Papers (6)
| | PDF (739 KB) | HTML

In this paper, we consider the additive white Gaussian noise (AWGN) channel with a power constraint called the (o, ρ)-power constraint, which is motivated by energy harvesting communication systems. Given a codeword, the constraint imposes a limit of σ + kρ on the total power of any k ≥ 1 consecutive transmitted symbols. Such a channel has infinite memory and evaluating its exact capacity is a dif... View full abstract»

• ### A Simple Proof for the Existence of “Good” Pairs of Nested Lattices

Publication Year: 2016, Page(s):4439 - 4453
Cited by:  Papers (21)
| | PDF (484 KB) | HTML

This paper provides a simplified proof for the existence of nested lattice codebooks allowing to achieve the capacity of the additive white Gaussian noise channel, as well as the optimal rate-distortion tradeoff for a Gaussian source. The proof is self-contained and relies only on basic probabilistic and geometrical arguments. An ensemble of nested lattices that is different, and more elementary, ... View full abstract»

• ### Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels

Publication Year: 2016, Page(s):4454 - 4465
Cited by:  Papers (2)
| | PDF (483 KB) | HTML

Many of the classic problems of the coding theory are highly symmetric, which makes it easy to derive the sphere-packing upper bounds on the size of codes. We discuss the generalizations of the sphere-packing bounds to the arbitrary error models. These generalizations become especially important when the sizes of the error spheres are nonuniform. The best possible sphere-packing bounds are the sol... View full abstract»

• ### Explicit Minimum Storage Regenerating Codes

Publication Year: 2016, Page(s):4466 - 4480
Cited by:  Papers (16)
| | PDF (911 KB) | HTML

In distributed storage, a file is stored in a set of nodes and protected by erasure-correcting codes. Regenerating code is a type of code with two properties: first, it can reconstruct the entire file in the presence of any r node erasures for some specified integer r; second, it can efficiently repair an erased node from any subset of remaining nodes with a given size. In the repair process, the ... View full abstract»

• ### Locality and Availability in Distributed Storage

Publication Year: 2016, Page(s):4481 - 4493
Cited by:  Papers (23)
| | PDF (936 KB) | HTML

This paper studies the problem of information symbol availability in codes: we refer to a systematic code as code with (r, t)-availability if every information (systematic) symbol can be reconstructed from t disjoint groups of other code symbols, each of the sizes at most r. This paper shows that it is possible to construct codes that can support a scaling number of parallel reads while keeping th... View full abstract»

• ### New Results on Codes Correcting Single Error of Limited Magnitude for Flash Memory

Publication Year: 2016, Page(s):4494 - 4500
Cited by:  Papers (3)
| | PDF (296 KB) | HTML

Some physical effects that limit the reliability and performance of multilevel flash memories induce errors that have low magnitudes and are dominantly asymmetric. This motivated the application of the asymmetric limited magnitude error model in flash memory. In this paper, we present a new construction of quasi-perfect codes for such errors, and we also study the perfect codes with symmetric erro... View full abstract»

• ### Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights

Publication Year: 2016, Page(s):4501 - 4513
Cited by:  Papers (4)
| | PDF (1700 KB) | HTML

Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of cyclic codes whose duals have two zeroes. A lower bound of the minimum Hamming distance is determined. In some cases, we give the Hamming weight distributions of the cyclic codes. In p... View full abstract»

• ### Counterexample to the Generalized Belfiore–Solé Secrecy Function Conjecture for$l$-Modular Lattices

Publication Year: 2016, Page(s):4514 - 4522
Cited by:  Papers (1)
| | PDF (517 KB) | HTML

In this paper, we show that the secrecy function conjecture that states that the maximum of the secrecy function of an l-modular lattice occurs at 1/√l is false, by proving that the four-modular lattice C(4)= ℤ ⊕√2ℤ ⊕ 2ℤ fails to satisfy this conjecture. After this, we indicate how the secrecy function must be modified in the l-modular case to provide a more meaningful comparison for l-... View full abstract»

• ### On the Basic Limits of RF-Fingerprint-Based Authentication

Publication Year: 2016, Page(s):4523 - 4543
Cited by:  Papers (4)
| | PDF (1336 KB) | HTML

RF fingerprinting exploits the variations in the RF chain of radios to uniquely identify transmitters, and distinguish adversarial transmissions from the transmissions of legitimate nodes. We provide a systematic approach rooted from the information theory to evaluate the basic performance limits of RF fingerprinting. We develop a novel channel model for RF fingerprinting, where the imperfections ... View full abstract»

• ### Secure Cooperative Source-Coding With Side Information at the Eavesdropper

Publication Year: 2016, Page(s):4544 - 4558
Cited by:  Papers (1)
| | PDF (416 KB) | HTML

In the secure cooperative source-coding problem that we consider, Encoder 1 and Decoder 1 observe, respectively, a pair of independent identically distributed (i.i.d.) correlated sources and wish to communicate the first source to Decoder 2 subject to a distortion constraint. Encoder 1 sends a message to both the decoders over a public nonsecure channel, and then Decoder 1-the helper-sends a messa... View full abstract»

• ### Zero-One Laws for Connectivity in Inhomogeneous Random Key Graphs

Publication Year: 2016, Page(s):4559 - 4574
Cited by:  Papers (5)
| | PDF (331 KB) | HTML

We introduce a new random key predistribution scheme for securing heterogeneous wireless sensor networks. Each of the n sensors in the network is classified into r classes according to some probability distribution μ = {μ1, . . . , μr}. Before deployment, a class-i sensor is assigned Kicryptographic keys that are selected uniformly at random from a common pool of P... View full abstract»

• ### Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback

Publication Year: 2016, Page(s):4575 - 4588
Cited by:  Papers (5)
| | PDF (446 KB) | HTML

We provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any nonadaptive protocol can withstand is 1/3. In addition, we provide a simple and efficient nonadaptive coding scheme that succeeds as long as the fraction of noise is at most 1/3 - ε. Surprisingly, both b... View full abstract»

Publication Year: 2016, Page(s):4589 - 4603
Cited by:  Papers (13)
| | PDF (2087 KB) | HTML

An uplink-downlink two-cell cellular network is studied in which the first base station (BS) with M1antennas receives independent messages from its N1serving users, while the second BS with M2antennas transmits independent messages to its N2serving users. That is, the first and second cells operate as uplink and downlink, respectively. Each user is assum... View full abstract»

• ### Free Deterministic Equivalents for the Analysis of MIMO Multiple Access Channel

Publication Year: 2016, Page(s):4604 - 4629
Cited by:  Papers (10)
| | PDF (1014 KB) | HTML

In this paper, a free deterministic equivalent is proposed for the capacity analysis of the multi-input multi-output (MIMO) multiple access channel (MAC) with a more general channel model compared to previous works. In particular, a MIMO MAC with one base station (BS) equipped with several distributed antenna sets is considered. Each link between a user and a BS antenna set forms a jointly correla... View full abstract»

• ### On the Optimality of Treating Interference as Noise: Compound Interference Networks

Publication Year: 2016, Page(s):4630 - 4653
Cited by:  Papers (3)
| | PDF (2050 KB) | HTML

In a K-user Gaussian interference channel, it has been shown by Geng et al. that if for each user, the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user (all values in decibel scale), then power control and treating interference as noise (TIN) is optimal from the perspective of generalized degre... View full abstract»

• ### Optimality of Treating Interference as Noise: A Combinatorial Perspective

Publication Year: 2016, Page(s):4654 - 4673
Cited by:  Papers (8)
| | PDF (1368 KB) | HTML

For single-antenna Gaussian interference channels, we reformulate the problem of determining the generalized degrees of freedom (GDoF) region achievable by treating interference as Gaussian noise (TIN) derived by Geng et al. from a combinatorial optimization perspective. We show that the TIN power control problem can be cast into an assignment problem, such that the globally optimal power allocati... View full abstract»

• ### Optimal Offline and Competitive Online Strategies for Transmitter–Receiver Energy Harvesting

Publication Year: 2016, Page(s):4674 - 4695
Cited by:  Papers (6)
| | PDF (1647 KB) | HTML

A joint transmitter-receiver energy harvesting model is considered, where both the transmitter and the receiver are powered by random (renewable) energy source. Given a fixed number of bits, the problem is to find the optimal transmission power profile at the transmitter and ON-OFF profile at the receiver to minimize the transmission time. With infinite capacity at both the transmitter and the rec... View full abstract»

• ### Error Decay of (Almost) Consistent Signal Estimations From Quantized Gaussian Random Projections

Publication Year: 2016, Page(s):4696 - 4709
Cited by:  Papers (1)
| | PDF (396 KB) | HTML

This paper provides new error bounds on consistent reconstruction methods for signals observed from quantized random projections. Those signal estimation techniques guarantee a perfect matching between the available quantized data and a new observation of the estimated signal under the same sensing model. Focusing on dithered uniform scalar quantization of resolution δ > 0, we prove first that,... View full abstract»

Publication Year: 2016, Page(s):4710 - 4732
Cited by:  Papers (12)
| | PDF (1710 KB) | HTML

This paper examines the close interplay between cooperation and adaptation for distributed detection schemes over fully decentralized networks. The combined attributes of cooperation and adaptation are necessary to enable networks of detectors to continually learn from streaming data and to continually track drifts in the state of nature when deciding in favor of one hypothesis or another. The res... View full abstract»

• ### Restricted$q$-Isometry Properties Adapted to Frames for Nonconvex$l_{q}$-Analysis

Publication Year: 2016, Page(s):4733 - 4747
| | PDF (393 KB) | HTML

This paper discusses the reconstruction of signals from few measurements in the situation that signals are sparse or approximately sparse in terms of a general frame via the lq-analysis optimization with 0 <; q ≤ 1. We first introduce a notion of restricted q-isometry property (q-RIP) adapted to a dictionary, which is a natural extension of the standard q-RIP, and establish a general... 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