# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 31

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

Publication Year: 2015, Page(s): C2
| PDF (140 KB)
• ### On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes

Publication Year: 2015, Page(s):1153 - 1158
Cited by:  Papers (1)
| | PDF (195 KB) | HTML

Let C = (C1, C2, ...) be a sequence of codes such that each Ci is a linear [ni, ki, di]-code over some fixed finite field F, where ni is the length of the code words, ki is the dimension, and di is the minimum distance. We say that C is asymptotically good if, for some ε > 0 and for all i &... View full abstract»

• ### Squares of Random Linear Codes

Publication Year: 2015, Page(s):1159 - 1173
Cited by:  Papers (5)
| | PDF (314 KB) | HTML

Given a linear code C, one can define the dth power of C as the span of all componentwise products of d elements of C. A power of C may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code typically fill the whole space? We give a positive answer, for codes of dimension k and length roughly (1/2)k2 or smaller. Moreover, the convergence... View full abstract»

• ### Counting Extended Irreducible Binary Quartic Goppa Codes of Length $2^{n}+1$

Publication Year: 2015, Page(s):1174 - 1178
| | PDF (419 KB) | HTML

We produce an upper bound on the number of extended irreducible binary quartic Goppa codes of length 2n+1, where n > 3 is a prime number. View full abstract»

• ### Algebraic Decoding of Some Quadratic Residue Codes With Weak Locators

Publication Year: 2015, Page(s):1179 - 1187
Cited by:  Papers (2)
| | PDF (358 KB) | HTML

In this paper, an explicit expression of the weak-locator polynomial for p-ary quadratic residue codes is presented by a modification of the Feng-Tzeng matrix method. The differences between the modified version and the original Feng-Tzeng matrix are that in the new matrix, not every entry is a syndrome, and every syndrome entry is a known syndrome. By utilizing this technique, an algebraic decodi... View full abstract»

• ### Self-Dual Codes With an Automorphism of Order 11

Publication Year: 2015, Page(s):1188 - 1193
Cited by:  Papers (1)
| | PDF (732 KB) | HTML

Using a method for constructing self-dual codes having an automorphism of odd prime order, we classify up to equivalence all binary self-dual codes with an automorphism of order 11 with 6 cycles and minimum distance 12. This classification gives new [72, 36, 12] codes with weight enumerator that was previously not obtained as well as many [66, 33, 12], [68, 34, 12], and [70, 35, 12] codes with new... View full abstract»

• ### Cellular Interference Alignment

Publication Year: 2015, Page(s):1194 - 1217
Cited by:  Papers (18)
| | PDF (5172 KB) | HTML

Interference alignment promises that, in Gaussian interference channels, each link can support half of a degree of freedom (DoF) per pair of transmit-receive antennas. However, in general, this result requires to precode the data bearing signals over a signal space of asymptotically large diversity, e.g., over an infinite number of dimensions for time-frequency varying fading channels, or over an ... View full abstract»

• ### Minimization of CSI Feedback Dimension for Interference Alignment in MIMO Interference Multicast Networks

Publication Year: 2015, Page(s):1218 - 1246
Cited by:  Papers (5)
| | PDF (3495 KB) | HTML

It is well-known that interference alignment (IA) can achieve substantial theoretical gains in multiple-input multiple-output (MIMO) networks. However, the conventional works usually assume the full channel state information (CSI) is available at the transmitter side, which would create a overwhelming CSI feedback overhead for practical frequency-division duplexing (FDD) wireless systems. To imple... View full abstract»

• ### Relaying for Multiuser Networks in the Absence of Codebook Information

Publication Year: 2015, Page(s):1247 - 1256
Cited by:  Papers (1)
| | PDF (514 KB) | HTML

This paper considers relay assisted transmission for multiuser networks when the relay has no access to the codebooks used by the transmitters. The relay is called oblivious for this reason. Of particular interest is the generalized compress-and-forward (GCF) strategy, where the destinations jointly decode the compression indices and the transmitted messages, and their optimality in this setting. ... View full abstract»

• ### On the Two-User Interference Channel With Lack of Knowledge of the Interference Codebook at One Receiver

Publication Year: 2015, Page(s):1257 - 1276
Cited by:  Papers (6)
| | PDF (840 KB) | HTML

In multiuser information theory, it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed ad hoc, cognitive, or heterogeneous networks. This paper considers the two-user interference channel with one oblivious receiver (IC-OR), i.e., one receiver lacks knowledge of the interfering cookbook, whereas the other r... View full abstract»

• ### Optimal Algorithms for Universal Random Number Generation From Finite Memory Sources

Publication Year: 2015, Page(s):1277 - 1297
Cited by:  Papers (1)
| | PDF (1011 KB) | HTML

We study random number generators (RNGs), both in the fixed to variable-length (FVR) and the variable to fixed-length (VFR) regimes, in a universal setting in which the input is a finite memory source of arbitrary order and unknown parameters, with arbitrary input and output (finite) alphabet sizes. Applying the method of types, we characterize essentially unique optimal universal RNGs that maximi... View full abstract»

• ### On Haroutunian’s Exponent for Parallel Channels and an Application to Fixed-Delay Codes Without Feedback

Publication Year: 2015, Page(s):1298 - 1308
| | PDF (569 KB) | HTML

The Haroutunian exponent arises in the study of channel reliability functions for both block coding with feedback and fixed-delay coding without feedback. For asymmetric channels, such as the Z-channel, the Haroutunian exponent is strictly larger than the sphere-packing exponent. The spherepacking exponent is believed to be an upper bound for the reliability function in the two aforementioned comm... View full abstract»

• ### Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages

Publication Year: 2015, Page(s):1309 - 1324
Cited by:  Papers (1)
| | PDF (989 KB) | HTML

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of codewords, our scheme improves considerably upon the conventional coding schemes which treat interference as noise or decode messages simultaneously. Our strategy also ... View full abstract»

• ### On the Secrecy Capacity of Block Fading Channels With a Hybrid Adversary

Publication Year: 2015, Page(s):1325 - 1343
Cited by:  Papers (8)
| | PDF (1156 KB) | HTML

We consider a block fading wiretap channel, where a transmitter attempts to send messages securely to a receiver in the presence of a hybrid half-duplex adversary, which arbitrarily decides to either jam or eavesdrop the transmitter-to-receiver channel. We provide bounds to the secrecy capacity for various possibilities on receiver feedback and show special cases where the bounds are tight. We sho... View full abstract»

• ### Deception With Side Information in Biometric Authentication Systems

Publication Year: 2015, Page(s):1344 - 1350
Cited by:  Papers (1)
| | PDF (202 KB) | HTML

In this paper, we study the probability of successful deception of an uncompressed biometric authentication system with side information at the adversary. It represents the scenario where the adversary may have correlated side information, e.g., a partial finger print or a DNA sequence of a relative of the legitimate user. We find the optimal exponent of the deception probability by proving both t... View full abstract»

• ### Distributed Kalman Filtering Over Massive Data Sets: Analysis Through Large Deviations of Random Riccati Equations

Publication Year: 2015, Page(s):1351 - 1372
Cited by:  Papers (14)
| | PDF (938 KB) | HTML

This paper studies the convergence of the estimation error process and the characterization of the corresponding invariant measure in distributed Kalman filtering for potentially unstable and large linear dynamic systems. A gossip network protocol termed modified gossip interactive Kalman filtering (M-GIKF) is proposed, where sensors exchange their filtered states (estimates and error covariances)... View full abstract»

• ### Sketching Sparse Matrices, Covariances, and Graphs via Tensor Products

Publication Year: 2015, Page(s):1373 - 1388
Cited by:  Papers (8)
| | PDF (850 KB) | HTML

This paper considers the problem of recovering an unknown sparse p×p matrix X from an m×m matrix Y=AXBT, where A and B are known m×p matrices with m≪p. The main result shows that there exist constructions of the sketching matrices A and B so that even if X has O(p) nonzeros, it can be recovered exactly and efficiently using a convex program as long as these n... View full abstract»

• ### Time Invariant Error Bounds for Modified-CS-Based Sparse Signal Sequence Recovery

Publication Year: 2015, Page(s):1389 - 1409
Cited by:  Papers (4)
| | PDF (1181 KB) | HTML

In this paper, we obtain performance guarantees for modified-CS and for its improved version, modified-CS-Add-LS-Del, for recursive reconstruction of a time sequence of sparse signals from a reduced set of noisy measurements available at each time. Under mild assumptions, we show that the support recovery error of both algorithms is bounded by a time-invariant and small value at all times. The sam... View full abstract»

• ### Compression Limits for Random Vectors with Linearly Parameterized Second-Order Statistics

Publication Year: 2015, Page(s):1410 - 1425
Cited by:  Papers (17)
| | PDF (573 KB) | HTML

The class of complex random vectors whose covariance matrix is linearly parameterized by a basis of Hermitian Toeplitz (HT) matrices is considered, and the maximum compression ratios that preserve all second-order information are derived-the statistics of the uncompressed vector must be recoverable from a set of linearly compressed observations. This kind of vectors arises naturally when sampling ... View full abstract»

• ### MLE’s Bias Pathology, Model Updated MLE, and Wallace’s Minimum Message Length Method

Publication Year: 2015, Page(s):1426 - 1431
| | PDF (203 KB) | HTML

The inherent bias pathology of the maximum likelihood estimation method is confirmed for models with unknown parameters θ and ψ when maximum likelihood estimate (MLE) ψ̂ is function of MLE θ̂. To reduce ψ̂'s bias the likelihood equation to be solved for ψ is updated using the model for the data Y in it. For various models with ψ... View full abstract»

• ### Active Hypothesis Testing for Anomaly Detection

Publication Year: 2015, Page(s):1432 - 1450
Cited by:  Papers (10)
| | PDF (840 KB) | HTML

The problem of detecting a single anomalous process among a finite number M of processes is considered. At each time, a subset of the processes can be observed, and the observations from each chosen process follow two different distributions, depending on whether the process is normal or abnormal. The objective is a sequential search strategy that minimizes the expected detection time subject to a... View full abstract»

• ### The Information Geometry of Mirror Descent

Publication Year: 2015, Page(s):1451 - 1457
Cited by:  Papers (3)
| | PDF (386 KB) | HTML

We prove the equivalence of two online learning algorithms: 1) mirror descent and 2) natural gradient descent. Both mirror descent and natural gradient descent are generalizations of online gradient descent when the parameter of interest lies on a non-Euclidean manifold. Natural gradient descent selects the steepest descent along a Riemannian manifold by multiplying the standard gradient by the in... View full abstract»

• ### Tight Bound on Relative Entropy by Entropy Difference

Publication Year: 2015, Page(s):1458 - 1473
Cited by:  Papers (4)
| | PDF (514 KB) | HTML

We prove a lower bound on the relative entropy between two finite-dimensional states in terms of their entropy difference and the dimension of the underlying space. The inequality is tight in the sense that equality can be attained for any prescribed value of the entropy difference, both for quantum and classical systems. We outline implications for information theory and thermodynamics, such as a... View full abstract»

• ### Application of Constacyclic Codes to Quantum MDS Codes

Publication Year: 2015, Page(s):1474 - 1484
Cited by:  Papers (22)
| | PDF (818 KB) | HTML

Quantum maximum-distance-separable (MDS) codes form an important class of quantum codes. To get q-ary quantum MDS codes, one of the effective ways is to find linear MDS codes C over Fq2 satisfying C⊥H⊆ C, where C⊥H denotes the Hermitian dual code of C. For a linear code C of length n over Fq2, we say that C is a dual-containing code ... 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