IEEE Transactions on Information Theory

Filter Results

Displaying Results 1 - 25 of 41

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

Publication Year: 2013, Page(s): C2
| PDF (142 KB)
• MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom

Publication Year: 2013, Page(s):4733 - 4745
Cited by:  Papers (23)
| | PDF (3486 KB) | HTML

A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices of the legitimate users are fixed and revealed to all the terminals, whereas the channel matrices of the eavesdropper are arbitrarily varying and only known to the eavesdropper. The secrecy degrees of freedom (s.d.o.f.) region under a strong secrecy constrain... View full abstract»

• Gaussian Channel With Noisy Feedback and Peak Energy Constraint

Publication Year: 2013, Page(s):4746 - 4756
Cited by:  Papers (3)
| | PDF (2770 KB) | HTML

Optimal coding over the additive white Gaussian noise channel under the peak energy constraint is studied when there is noisy feedback over an orthogonal additive white Gaussian noise channel. As shown by Pinsker, under the peak energy constraint, the best error exponent for communicating an M-ary message, M ≥ 3, with noise-free feedback is strictly larger than the one without feedback. This paper... View full abstract»

• Error Exponent for Gaussian Channels With Partial Sequential Feedback

Publication Year: 2013, Page(s):4757 - 4766
Cited by:  Papers (6)
| | PDF (1997 KB) | HTML

This paper studies the error exponent of block coding over an additive white Gaussian noise channel where a fraction (<formula formulatype="inline"><tex Notation="TeX">$f$</tex></formula>) of the channel output symbols are revealed to the transmitter through noiseless feedback. If the code rate exceeds <formula formulatype="inline"><tex Notation="TeX">$fC$</t... View full abstract»

• Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs

Publication Year: 2013, Page(s):4767 - 4770
Cited by:  Papers (2)
| | PDF (922 KB) | HTML

In this paper, we study Shannon capacity of channels in the context of classical Ramsey numbers. We overview some of the results on capacity of noisy channels modeled by graphs, and how some constructions may contribute to our knowledge of this capacity. We present an improvement to the constructions by Abbott and Song and thus establish new lower bounds for a special type of multicolor Ramsey num... View full abstract»

• Cover's Algorithm Modified for Nonparametric Estimation of a Log-Optimal Portfolio Selection Function

Publication Year: 2013, Page(s):4771 - 4780
| | PDF (3250 KB) | HTML

Cover's algorithm yields an iterative portfolio choice for maximizing expected log investment return where the distribution function of the stock market vector is known. In the case that the stock market vectors form a stationary ergodic sequence with unknown distribution, by stochastic approximation and nonparametric regression estimation the algorithm is modified for iterative estimation of a lo... View full abstract»

• The Capacity Region of the MIMO Interference Channel and Its Reciprocity to Within a Constant Gap

Publication Year: 2013, Page(s):4781 - 4797
Cited by:  Papers (31)
| | PDF (5356 KB) | HTML

The capacity region of the two-user multi-input multioutput (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary number of antennas at each node. An achievable rate region and an outer bound to the capacity region of a class of interference channels were obtained in prev... View full abstract»

• The Degrees-of-Freedom Region of the MIMO Interference Channel With Shannon Feedback

Publication Year: 2013, Page(s):4798 - 4810
Cited by:  Papers (12)
| | PDF (3036 KB) | HTML

The two-user multiple-input multiple-output (MIMO) fast-fading interference channel (IC) with an arbitrary number of antennas at each of the four terminals is studied under the settings of Shannon feedback and output feedback, wherein channel matrices and outputs, or just the channel outputs, respectively, are available to the transmitters with a delay. While for most numbers of antennas at the fo... View full abstract»

• Bounds on the Capacity Region for a Class of Interference Channels With Common Information

Publication Year: 2013, Page(s):4811 - 4818
Cited by:  Papers (3)
| | PDF (2832 KB) | HTML

An approximate capacity result is demonstrated for a specific class of interference channels with common information (IC-CI). The class is the semideterministic interference channel of Telatar and Tse, and the outer bound herein generalizes their bound from the case where each transmitter sends only private information to the case where each transmitter sends both private and common information to... View full abstract»

• Guiding Blind Transmitters: Degrees of Freedom Optimal Interference Alignment Using Relays

Publication Year: 2013, Page(s):4819 - 4832
Cited by:  Papers (24)
| | PDF (2699 KB) | HTML

Channel state information (CSI) at the transmitters (CSIT) is of importance for interference alignment schemes to achieve the optimal degrees of freedom (DoF) for wireless networks. This paper investigates the impact of half-duplex relays on the DoF of the X channel and the interference channel when the transmitters are blind in the sense that no CSIT is available. In particular, it is shown that ... View full abstract»

• Proactive Resource Allocation: Harnessing the Diversity and Multicast Gains

Publication Year: 2013, Page(s):4833 - 4854
Cited by:  Papers (38)
| | PDF (5370 KB) | HTML

This paper introduces the novel concept of proactive resource allocation for wireless networks, through which the predictability of user behavior is exploited to balance the wireless traffic over time, and significantly reduces the bandwidth required to achieve a given blocking/outage probability. We start with a simple model in which smart wireless devices are assumed to predict the arrival of ne... View full abstract»

• Interference Alignment: From Degrees of Freedom to Constant-Gap Capacity Approximations

Publication Year: 2013, Page(s):4855 - 4888
Cited by:  Papers (41)
| | PDF (9424 KB) | HTML

Interference alignment is a key technique for communication scenarios with multiple interfering links. In several such scenarios, interference alignment was used to characterize the degrees of freedom of the channel. However, these degree-of-freedom capacity approximations are often too weak to make accurate predictions about the behavior of channel capacity at finite signal-to-noise ratios (SNRs)... View full abstract»

• Shannon Meets Nyquist: Capacity of Sampled Gaussian Channels

Publication Year: 2013, Page(s):4889 - 4914
Cited by:  Papers (15)
| | PDF (6738 KB) | HTML

We explore two fundamental questions at the intersection of sampling theory and information theory: how channel capacity is affected by sampling below the channel's Nyquist rate, and what sub-Nyquist sampling strategy should be employed to maximize capacity. In particular, we derive the capacity of sampled analog channels for three prevalent sampling strategies: sampling with filtering, sampling w... View full abstract»

• Effects of the LLL Reduction on the Success Probability of the Babai Point and on the Complexity of Sphere Decoding

Publication Year: 2013, Page(s):4915 - 4926
Cited by:  Papers (18)
| | PDF (3536 KB) | HTML

A common method to estimate an unknown integer parameter vector in a linear model is to solve an integer least squares (ILS) problem. A typical approach to solving an ILS problem is sphere decoding. To make a sphere decoder faster, the well-known LLL reduction is often used as preprocessing. The Babai point produced by the Babai nearest plane algorithm is a suboptimal solution of the ILS problem. ... View full abstract»

• Lattice Codes for the Gaussian Relay Channel: Decode-and-Forward and Compress-and-Forward

Publication Year: 2013, Page(s):4927 - 4948
Cited by:  Papers (39)
| | PDF (5321 KB) | HTML

Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as i.i.d. random Gaussian codebooks. Lattice codes are also known to outperform random codes for certain channel models that are able to exploit their linearity. In this paper, we show that lattice codes may be used to achieve the same performance as known i.i.d. Gaussian random coding tech... View full abstract»

• On the Capacity of Multiplicative Finite-Field Matrix Channels

Publication Year: 2013, Page(s):4949 - 4960
Cited by:  Papers (3)
| | PDF (3014 KB) | HTML

This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes that all transfer matrices with the same rank are equiprobable, so that the channel is completely characterized by the rank distribution of the transfer matrix. Th... View full abstract»

• Optimal Spectrum Management in Multiuser Interference Channels

Publication Year: 2013, Page(s):4961 - 4976
Cited by:  Papers (2)
| | PDF (3992 KB) | HTML

In this paper, we study the problem of continuous frequency optimal spectrum management in multiuser frequency selective interference channels. We assume that interference is treated as noise by the decoders, and separate encoding is applied. First, a simple pair-wise channel condition for frequency division multiple access schemes to achieve all Pareto optimal points of the rate region is derived... View full abstract»

• Almost Sure Optimality of Sliding Window Lempel–Ziv Algorithm and Variants Revisited

Publication Year: 2013, Page(s):4977 - 4984
Cited by:  Papers (5)
| | PDF (1462 KB) | HTML

The sliding window Lempel-Ziv (SWLZ) algorithm has been studied extensively in the information theory literature and has been used in several commercial compression packages. The asymptotic behavior of this algorithm has been studied by Wyner and Ziv and by Shields using different approaches. Shields' results proving asymptotic optimality for all individual sequences with respect to the class of a... View full abstract»

• Autocorrelations of Binary Sequences and Run Structure

Publication Year: 2013, Page(s):4985 - 4993
Cited by:  Papers (1)
| | PDF (3131 KB) | HTML

We analyze the connection between the autocorrelation of a binary sequence and its run structure given by the run length encoding. We show that both the periodic and the aperiodic autocorrelation of a binary sequence can be formulated in terms of the run structure. The run structure is given by the consecutive runs of the sequence. Let C = (C0, C1,..., Cn) denote t... View full abstract»

• New Constructions of Zero-Correlation Zone Sequences

Publication Year: 2013, Page(s):4994 - 5007
Cited by:  Papers (15)
| | PDF (5152 KB) | HTML

In this paper, we propose three classes of systematic approaches for constructing zero-correlation zone (ZCZ) sequence families. In most cases, these approaches are capable of generating sequence families that achieve the upper bounds on the family size and the ZCZ width for a given sequence period. Our approaches can produce various binary and polyphase ZCZ families with desired parameters and al... View full abstract»

• A New Construction of Zero-Difference Balanced Functions and Its Applications

Publication Year: 2013, Page(s):5008 - 5015
Cited by:  Papers (15)
| | PDF (2231 KB) | HTML

In this paper, a new construction of zero-difference balanced functions defined on is given, where is an odd positive integer. Based on the generic constructions proposed by Ding, optimal constant composition codes and perfect difference systems of sets with new parameters can be generated from the zero-difference balanced functions constructed in this paper. View full abstract»

• Further Result on Distribution Properties of Compressing Sequences Derived From Primitive Sequences Over${\bf Z}/(p^{e})$

Publication Year: 2013, Page(s):5016 - 5022
Cited by:  Papers (4)
| | PDF (2476 KB) | HTML

Let p be an odd prime number, e an integer greater than 1, and Z/(pe) the integer residue ring modulo pe. In this paper, we obtain an improved result of the previous paper (IEEE Trans. Inf. Theory, 56(1) (2010) 555-563) on distribution properties of compressing sequences derived from primitive sequences over Z/(pe). It is shown that two primitive sequences α and b ... View full abstract»

• On the Performance Limits of Map-Aware Localization

Publication Year: 2013, Page(s):5023 - 5038
Cited by:  Papers (17)
| | PDF (3696 KB) | HTML

Establishing bounds on the accuracy achievable by localization techniques represents a fundamental technical issue. Bounds on localization accuracy have been derived for cases in which the position of an agent is estimated on the basis of a set of observations and, possibly, of some a priori information related to them (e.g., information about anchor positions and properties of the communication c... View full abstract»

• The Sample Complexity of Search Over Multiple Populations

Publication Year: 2013, Page(s):5039 - 5050
Cited by:  Papers (5)
| | PDF (2095 KB) | HTML

This paper studies the sample complexity of searching over multiple populations. We consider a large number of populations, each corresponding to either distribution P<sub>0</sub> or P<sub>1</sub>. The goal of the search problem studied here is to find one population corresponding to distribution P<sub>1</sub> with as few samples as possible. The main contributi... 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