# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 39

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

Publication Year: 2011, Page(s): C2
| PDF (140 KB)
• ### Robust Matrix Decomposition With Sparse Corruptions

Publication Year: 2011, Page(s):7221 - 7234
Cited by:  Papers (44)  |  Patents (1)
| | PDF (341 KB) | HTML

Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix, and the goal is to recover these individual components from the observed sum. Such additive decompositions have applications in a variety of numerical problems including system identification, latent variable graphical modeling, and principal components analysis. We study conditions under whic... View full abstract»

• ### A Probabilistic and RIPless Theory of Compressed Sensing

Publication Year: 2011, Page(s):7235 - 7254
Cited by:  Papers (178)  |  Patents (1)
| | PDF (412 KB) | HTML

This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a probability distribution F; it includes all standard models-e.g., Gaussian, frequency measurements-discussed in the literature, but also provides a framework for new measurement strategies as well. We prove that if... View full abstract»

• ### On the Performance of Sparse Recovery Via $ell_p$-Minimization $(0 leq p leq 1)$

Publication Year: 2011, Page(s):7255 - 7278
Cited by:  Papers (22)
| | PDF (1199 KB) | HTML

It is known that a high-dimensional sparse vector x* in TV can be recovered from low-dimensional measurements y = Ax* where Am×n(m <; n) is the measurement matrix. In this paper, with A being a random Gaussian matrix, we investigate the recovering ability of ℓp-minimization (0 ≤ p ≤ 1) as p varies, where ℓp-minimization returns... View full abstract»

• ### Optimally Sparse Frames

Publication Year: 2011, Page(s):7279 - 7287
Cited by:  Papers (16)
| | PDF (192 KB) | HTML

Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. However, when the signal dimension is large, the computation of the frame measurements of a signal typically requires a large number of additions and multiplications, and this makes a frame decomposition intractable in applic... View full abstract»

• ### Inferring Rankings Using Constrained Sensing

Publication Year: 2011, Page(s):7288 - 7306
Cited by:  Papers (8)  |  Patents (1)
| | PDF (390 KB) | HTML

We consider the problem of recovering a function over the space of permutations (or, the symmetric group) over n elements from given partial information; the partial information we consider is related to the group theoretic Fourier Transform of the function. This problem naturally arises in several settings such as ranked elections, multi-object tracking, ranking systems, and recommendation... View full abstract»

• ### Derivative of Mutual Information at Zero SNR: The Gaussian-Noise Case

Publication Year: 2011, Page(s):7307 - 7312
Cited by:  Papers (2)
| | PDF (167 KB) | HTML

Assuming additive Gaussian noise, a general sufficient condition on the input distribution is established to guarantee that the ratio of mutual information to signal-to-noise ratio (SNR) goes to one half nat as SNR vanishes. The result allows SNR-dependent input distribution and side information. View full abstract»

• ### Skewincidence

Publication Year: 2011, Page(s):7313 - 7316
Cited by:  Papers (1)
| | PDF (115 KB) | HTML

We introduce a new class of problems lying halfway between questions about graph capacity and intersection. We say that two binary sequences x and y of the same length have a skewincidence if there is a coordinate i for which xi=yi+1=1 or vice versa. We give relatively close bounds on the maximum number of binary sequences of length n any pair of which has... View full abstract»

• ### Probing Capacity

Publication Year: 2011, Page(s):7317 - 7332
Cited by:  Papers (30)
| | PDF (711 KB) | HTML

We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DMC) with i.i.d. states. The encoder takes probing actions dependent on the message. It then uses the state information obtained from probing causally or noncausally to generate channel input symbols. The decoder may also t... View full abstract»

• ### Communication Over Individual Channels

Publication Year: 2011, Page(s):7333 - 7358
Cited by:  Papers (16)
| | PDF (5534 KB) | HTML

A communication problem in considered, where no mathematical model is specified for the channel. The achievable rates are determined as a function of the channel input and output sequences known a-posteriori, without assuming any a-priori relation between them. For discrete channels the empirical mutual information between the input and output sequences is shown to be achievable, while for continu... View full abstract»

• ### The Capacity Region of p -Transmitter/ q -Receiver Multiple-Access Channels With Common Information

Publication Year: 2011, Page(s):7359 - 7376
Cited by:  Papers (5)
| | PDF (5711 KB) | HTML

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private messages and also a common message to q receivers and each receiver decodes all of the messages, is considered. The capacity region of the discrete memoryless channel... View full abstract»

• ### Noisy Channel Coding via Privacy Amplification and Information Reconciliation

Publication Year: 2011, Page(s):7377 - 7385
Cited by:  Papers (32)
| | PDF (254 KB) | HTML

We show that optimal protocols for noisy channel coding of public or private information over either classical or quantum channels can be directly constructed from two more primitive information-theoretic protocols: privacy amplification and information reconciliation, also known as data compression with side information. We do this in the one-shot scenario of structureless resources, and formulat... View full abstract»

• ### Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance

Publication Year: 2011, Page(s):7386 - 7402
Cited by:  Papers (10)
| | PDF (851 KB) | HTML

We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus improving the LP decoder, is proposed. Second, we present an algorithm which calculates a lower bound on the minimum distance of a specific code. This algorithm exhibits complexity which scales quadratically with the block ... View full abstract»

• ### Coding for High-Density Recording on a 1-D Granular Magnetic Medium

Publication Year: 2011, Page(s):7403 - 7417
Cited by:  Papers (21)
| | PDF (454 KB) | HTML

In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and also on the data written. We consider a simple 1-D combinatorial model of this medium. In our model, we assume a setting where binary data is sequentially written on the medium and a bit can erroneously... View full abstract»

• ### Characteristic Generators and Dualization for Tail-Biting Trellises

Publication Year: 2011, Page(s):7418 - 7430
Cited by:  Papers (7)
| | PDF (3206 KB) | HTML

This paper focuses on dualizing tail-biting trellises, particularly KV trellises. These trellises are based on characteristic generators, as introduced by Koetter-Vardy (2003), and may be regarded as a natural generalization of minimal conventional trellises, even though they are not necessarily minimal. Two dualization techniques will be investigated: the local dualization, introduced by Forney (... View full abstract»

• ### Constant-Weight Gray Codes for Local Rank Modulation

Publication Year: 2011, Page(s):7431 - 7442
Cited by:  Papers (17)
| | PDF (514 KB) | HTML

We consider the local rank-modulation (LRM) scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. LRM is a generalization of the rank-modulation scheme, which has been recently suggested as a way of storing information in flash memory. We study constant-weight Gray codes for the LRM scheme in order to simulate conventional multilevel fl... View full abstract»

• ### Semibent Functions From Dillon and Niho Exponents, Kloosterman Sums, and Dickson Polynomials

Publication Year: 2011, Page(s):7443 - 7458
Cited by:  Papers (13)
| | PDF (6102 KB) | HTML

Kloosterman sums have recently become the focus of much research, most notably due to their applications in cryptography and coding theory. In this paper, we extensively investigate the link between the semibentness property of functions in univariate forms obtained via Dillon and Niho functions and Kloosterman sums. In particular, we show that zeros and the value four of binary Kloosterman sums g... View full abstract»

• ### Some Codes Correcting Asymmetric Errors of Limited Magnitude

Publication Year: 2011, Page(s):7459 - 7472
Cited by:  Papers (13)
| | PDF (366 KB) | HTML

An error model with asymmetric errors of limited magnitude is a good model for some multilevel flash memories. This paper is about constructions of codes correcting such errors. The main results are about codes correcting a single such error and codes of length m correcting all errors in m-1 or less positions. View full abstract»

• ### Product Constructions for Perfect Lee Codes

Publication Year: 2011, Page(s):7473 - 7481
Cited by:  Papers (17)
| | PDF (2056 KB) | HTML

A well-known conjecture of Golomb and Welch is that the only nontrivial perfect codes in the Lee and Manhattan metrics have length two or minimum distance three. This problem and related topics were subject for extensive research in the last 40 years. In this paper, two product constructions for perfect Lee codes and diameter perfect Lee codes are presented. These constructions yield a large numbe... View full abstract»

• ### Constant Composition Codes as Subcodes of Cyclic Codes

Publication Year: 2011, Page(s):7482 - 7488
Cited by:  Papers (4)
| | PDF (2327 KB) | HTML

Constant composition codes are codes where the frequency distribution of the elements in a codeword is the same for all codewords. In this paper, three classes of constant composition codes are constructed. These codes are subcodes of cyclic codes which have few weights occurring among the codewords. The new codes are excellent asymptotically compared to the previously best known constant composit... View full abstract»

• ### Relative Difference Families With Variable Block Sizes and Their Related OOCs

Publication Year: 2011, Page(s):7489 - 7497
Cited by:  Papers (20)
| | PDF (261 KB) | HTML

Seven infinite classes of relative difference families with variable block sizes are presented explicitly. In particular, a balanced (gv,g,K,1)-DF with g=Σk∈K[(k2-k)/2] is explicitly given for: (i) K={3,4,5} and every v coprime to 6; (ii) K={3,4,6}, {3,5,6} or {3,4,5,6} and every v coprime to ... View full abstract»

• ### Binary Self-Dual Codes of Lengths 52 to 60 With an Automorphism of Order 7 or 13

Publication Year: 2011, Page(s):7498 - 7506
Cited by:  Papers (6)
| | PDF (502 KB) | HTML

All binary [n,n/2] optimal self-dual codes for length 52 ≤ n ≤ 60 with an automorphism of order 7 or 13 are classified up to equivalence. Two of the constructed [54,27,10] codes have weight enumerators that were not previously known to exist. There are also some [58,29,10] codes with new values of the parameters in their weight enumerator. View full abstract»

• ### Weight Distributions of Regular Low-Density Parity-Check Codes Over Finite Fields

Publication Year: 2011, Page(s):7507 - 7521
Cited by:  Papers (7)
| | PDF (359 KB) | HTML

The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the small-weight case, and a series of fundamental qualitative properties of the asymptotic growth rate of the average weight distribution are proved. Based on this ... View full abstract»

• ### On the Per-Sample Capacity of Nondispersive Optical Fibers

Publication Year: 2011, Page(s):7522 - 7541
Cited by:  Papers (13)
| | PDF (4139 KB) | HTML

The capacity of the channel defined by the stochastic nonlinear Schrödinger equation, which includes the effects of the Kerr nonlinearity and amplified spontaneous emission noise, is considered in the case of zero dispersion. In the absence of dispersion, this channel behaves as a collection of parallel per-sample channels. The conditional probability density function of the nonlinear per-... 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