# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 30

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

Publication Year: 2012, Page(s): C2
| PDF (142 KB)
• ### Consistent Nonparametric Regression for Functional Data Under the Stone–Besicovitch Conditions

Publication Year: 2012, Page(s):6697 - 6708
Cited by:  Papers (3)
| | PDF (4063 KB) | HTML

In this paper, we address the problem of nonparametric regression estimation in the infinite-dimensional setting. We start by extending the Stone's seminal result to the case of metric spaces when the probability measure of the explanatory variables is tight. Then, under slight variations on the hypotheses, we state and prove the theorem for general metric measure spaces. From this result, we deri... View full abstract»

• ### Efficient Tracking of Large Classes of Experts

Publication Year: 2012, Page(s):6709 - 6725
Cited by:  Papers (5)
| | PDF (4285 KB) | HTML

In the framework of prediction of individual sequences, sequential prediction methods are to be constructed that perform nearly as well as the best expert from a given class. We consider prediction strategies that compete with the class of switching strategies that can segment a given sequence into several blocks, and follow the advice of a different “base” expert in each block. As u... View full abstract»

• ### Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA

Publication Year: 2012, Page(s):6726 - 6736
| | PDF (1737 KB) | HTML

We study the degree to which a character string Q leaks details about itself any time it engages in comparison protocols with a strings provided by a querier, Bob, even if those protocols are cryptographically guaranteed to produce no additional information other than the scores that assess the degree to which Q matches strings offered by Bob. We show that such scenarios allow Bob to... View full abstract»

• ### Tight Bounds on the Redundancy of Huffman Codeshbox{ H }hbox{ H }

Publication Year: 2012, Page(s):6737 - 6746
Cited by:  Papers (5)
| | PDF (1988 KB) | HTML

In this paper, we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman codes, which yields in a tight upper bound. We also derive a tight lower bound for the redundancy under the same assumption. We further apply the... View full abstract»

• ### Secrecy via Sources and Channels

Publication Year: 2012, Page(s):6747 - 6765
Cited by:  Papers (14)
| | PDF (5353 KB) | HTML

Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. This problem of secret communication and secret-key generation when two resources are available-correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve which is independent of the sources is studied. The... View full abstract»

• ### An Outer Bound for the Gaussian MIMO Broadcast Channel With Common and Private Messages

Publication Year: 2012, Page(s):6766 - 6772
Cited by:  Papers (6)
| | PDF (1742 KB) | HTML

We consider the Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and private messages. We obtain an outer bound for the capacity region of this channel. To this end, we show that a parallel Gaussian broadcast channel can be constructed from any given Gaussian MIMO broadcast channel by using the generalized singular value decomposition and a relaxation on the power const... View full abstract»

• ### Capacity Analysis of Correlated MIMO Channels

Publication Year: 2012, Page(s):6773 - 6787
Cited by:  Papers (11)
| | PDF (3017 KB) | HTML

This paper gives expressions for the capacity of ergodic multiple-input multiple-output channels with finite dimensions, in which the channel gains have a correlated complex normal distribution and receivers experience independent Gaussian noise. The particular correlated normal distribution considered corresponds to flat Rayleigh fading with arbitrary transmit and receive correlation. Knowledge o... View full abstract»

• ### Diversity of MMSE MIMO Receivers

Publication Year: 2012, Page(s):6788 - 6805
Cited by:  Papers (32)
| | PDF (4851 KB) | HTML

In most multiple-input multiple-output (MIMO) systems, the family of waterfall error curves, calculated at different spectral efficiencies, are asymptotically parallel at high signal-to-noise ratio. In other words, most MIMO systems exhibit a single diversity value for all fixed rates. The MIMO minimum mean square error (MMSE) receiver does not follow this pattern and exhibits a varying diversity ... View full abstract»

• ### Degrees of Freedom of the Network MIMO Channel With Distributed CSI

Publication Year: 2012, Page(s):6806 - 6824
Cited by:  Papers (44)
| | PDF (3350 KB) | HTML

In this paper, we discuss the joint precoding with finite rate feedback in the so-called network multiple-input multiple-output (MIMO) where the TXs share the knowledge of the data symbols to be transmitted. We introduce a distributed channel state information (DCSI) model where each TX has its own local estimate of the overall multiuser MIMO channel and must make a precoding decision solely based... View full abstract»

• ### Outage Probability Under Channel Distribution Uncertainty

Publication Year: 2012, Page(s):6825 - 6838
Cited by:  Papers (9)
| | PDF (2213 KB) | HTML

Outage probability and capacity of a class of block fading MIMO channels are considered under partial channel distribution information. Specifically, the channel or its distribution is not known but the latter is known to belong to a class of distributions where each member is within a certain distance (uncertainty) from a nominal distribution. Relative entropy is used as a measure of distance bet... View full abstract»

• ### Product Superposition for MIMO Broadcast Channels

Publication Year: 2012, Page(s):6839 - 6852
Cited by:  Papers (13)
| | PDF (3086 KB) | HTML

This paper considers the multiantenna broadcast channel without transmit-side channel state information. For this channel, it has been known that when all receivers have channel state information (CSIR), the degrees of freedom (DoFs) cannot be improved beyond what is available via time-division multiple access. The same is true if none of the receivers possess CSIR. This paper shows that an entire... View full abstract»

• ### A New Outer Bound via Interference Localization and the Degrees of Freedom Regions of MIMO Interference Networks With No CSIT

Publication Year: 2012, Page(s):6853 - 6869
Cited by:  Papers (11)
| | PDF (5291 KB) | HTML

The two-user multiple-input multiple-output (MIMO) interference and cognitive radio channels are considered, where the ith transmitter and the ith receiver have Mi and Ni antennas, respectively. In particular, the degrees of freedom (DoF) regions of these channels are studied under the assumption of having no channel state information at the transm... View full abstract»

• ### Capacity Scaling of Single-Source Multiantenna Wireless Networks Without CSIT

Publication Year: 2012, Page(s):6870 - 6878
Cited by:  Papers (2)
| | PDF (2276 KB) | HTML

We consider a wireless network in which a single-source node having m antennas transmits independent messages to n destination nodes, where each destination node has a single antenna. We assume that the source is located at the center of a unit area and the destinations are located uniformly at random in the same area. By applying transmit beamforming at the source, an achievable sum... View full abstract»

• ### On the Asymptotic Validity of the Decoupling Assumption for Analyzing 802.11 MAC Protocol

Publication Year: 2012, Page(s):6879 - 6893
Cited by:  Papers (10)
| | PDF (3155 KB) | HTML

Performance evaluation of the 802.11 MAC protocol is classically based on the decoupling assumption, which hypothesizes that the backoff processes at different nodes are independent. This decoupling assumption results from mean field convergence and is generally true in transient regime in the asymptotic sense (when the number of wireless nodes tends to infinity), but, contrary to widespread belie... View full abstract»

• ### Coding Improves the Throughput-Delay Tradeoff in Mobile Wireless Networks

Publication Year: 2012, Page(s):6894 - 6906
Cited by:  Papers (10)
| | PDF (3146 KB) | HTML

This paper studies the throughput-delay performance tradeoff in large-scale wireless ad hoc networks. It has been shown that the per source-destination pair throughput can be improved from Θ(1/√{nlogn}) to Θ(1) if nodes are allowed to move and a two-hop relay scheme is employed. The price paid for such a throughput improvement is large delay. Indeed, the delay sc... View full abstract»

• ### Inapproximability Results for the Weight Problems of Subgroup Permutation Codes

Publication Year: 2012, Page(s):6907 - 6915
| | PDF (2876 KB) | HTML

A subgroup permutation code is a set of permutations on n symbols with the property that its elements are closed under the operation of composition. In this paper, we give inapproximability results for the minimum and maximum weight problems of subgroup permutation codes under several well-known metrics. Based on previous works, we prove that under Hamming, Lee, Cayley, Kendall's tau, Ulam'... View full abstract»

• ### The Automorphism Group of an Extremal $[{72,36,16}]$ Code Does Not Contain $Z_{7}$, $Z_{3}times Z_{3}$, or $D_{10}$

Publication Year: 2012, Page(s):6916 - 6924
Cited by:  Papers (4)
| | PDF (2627 KB) | HTML

A computer calculation with Magma shows that there is no extremal self-dual binary code C of length 72 that has an automorphism group containing either the dihedral group of order 10, the elementary abelian group of order 9, or the cyclic group of order 7. Combining this with the known results in the literature, one obtains that the order of Aut(C) is either 5 or divides 24. View full abstract»

• ### On the Locality of Codeword Symbols

Publication Year: 2012, Page(s):6925 - 6934
Cited by:  Papers (192)
| | PDF (2315 KB) | HTML

Consider a linear [n,k,d]q code C. We say that the ith coordinate of C has locality r , if the value at this coordinate can be recovered from accessing some other r coordinates of C. Data storage applications require codes with small redundancy, low locality for information coordinates, large distance, and low locality for p... View full abstract»

• ### A Deterministic Reduction for the Gap Minimum Distance Problem

Publication Year: 2012, Page(s):6935 - 6941
Cited by:  Papers (6)
| | PDF (1630 KB) | HTML

Determining the minimum distance of a linear code is one of the most important problems in algorithmic coding theory. The exact version of the problem was shown to be NP-complete by Vardy. The gap version of the problem was shown to be NP-hard for any constant factor under a randomized reduction in an earlier work. It was shown in the same paper that the minimum distance problem is not approximabl... View full abstract»

• ### Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes

Publication Year: 2012, Page(s):6942 - 6958
Cited by:  Papers (38)  |  Patents (1)
| | PDF (2430 KB) | HTML

This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. The algorithm can be used to estimate the error floor of LDPC codes or as a tool to design LDPC codes with low error floors. For regular codes, the algorithm is initiated with a set of short cycles as the input. For irregular codes, in addition to short cycles, variable node... View full abstract»

• ### A Fresh Look at Coding for $q$-ary Symmetric Channels

Publication Year: 2012, Page(s):6959 - 6967
Cited by:  Papers (3)
| | PDF (1736 KB) | HTML

This paper studies coding schemes for the q-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size q=2m, m ∈N, thus complementing some recently proposed packet-based schemes requiring large q . First, theoretical optimality of a simple layered scheme is shown; then, a practical coding scheme based on... View full abstract»

• ### New Families of Binary Sequence Pairs With Two-Level and Three-Level Correlation

Publication Year: 2012, Page(s):6968 - 6978
Cited by:  Papers (7)
| | PDF (4081 KB) | HTML

A pair of binary sequences is generalized from the concept of a two-level autocorrelation function of a single binary sequence. In this paper, new families of binary sequence pairs with period N = np, where gcd(n,p) = 1, and optimal correlation values -1 are constructed, as well as new families of binary sequence pairs with three-level correlation and period N≡0(mod 4). For the new binary s... View full abstract»

• ### Further Results on Niho Bent Functions

Publication Year: 2012, Page(s):6979 - 6985
Cited by:  Papers (20)
| | PDF (2008 KB) | HTML

This paper consists of two main contributions. First, the Niho bent function consisting of 2r exponents (discovered by Leander and Kholosha) is studied. The dual of the function is found and it is shown that this new bent function is not of the Niho type. Second, all known univariate representations of Niho bent functions are analyzed for their relation to the completed Maiorana-McFarland c... 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
Prakash Narayan

Department of Electrical and Computer Engineering