# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 43
• ### Table of contents

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

Publication Year: 2012, Page(s): C2
| PDF (42 KB)
• ### The LASSO Risk for Gaussian Matrices

Publication Year: 2012, Page(s):1997 - 2017
Cited by:  Papers (43)
| | PDF (6738 KB) | HTML

We consider the problem of learning a coefficient vector xο ∈ RN from noisy linear observation y = Axo + ∈ Rn. In many contexts (ranging from model selection to image processing), it is desirable to construct a sparse estimator x̂. In this case, a popular approach consists in solving an ℓ1-penalized least-squ... View full abstract»

• ### Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations

Publication Year: 2012, Page(s):2018 - 2039
Cited by:  Papers (9)
| | PDF (814 KB) | HTML

This paper establishes information-theoretic limits for estimating a finite-field low-rank matrix given random linear measurements of it. These linear measurements are obtained by taking inner products of the low-rank matrix with random sensing matrices. Necessary and sufficient conditions on the number of measurements required are provided. It is shown that these conditions are sharp and the mini... View full abstract»

• ### The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing

Publication Year: 2012, Page(s):2040 - 2047
Cited by:  Papers (71)
| | PDF (215 KB) | HTML

The general theory of greedy approximation is well developed. Much less is known about how specific features of a dictionary can be used to our advantage. In this paper, we discuss incoherent dictionaries. We build a new greedy algorithm which is called the orthogonal super greedy algorithm (OSGA). We show that the rates of convergence of OSGA and the orthogonal matching pursuit (OMP) with respect... View full abstract»

• ### On the Compound Capacity of a Class of MIMO Channels Subject to Normed Uncertainty

Publication Year: 2012, Page(s):2048 - 2063
Cited by:  Papers (25)  |  Patents (1)
| | PDF (346 KB) | HTML

The compound capacity of uncertain multiple-input multiple-output channels is considered, when the channel is modeled by a class described by a (known) nominal channel and a constrained-norm (unknown) uncertainty. Within this framework, two types of classes are investigated with additive and multiplicative uncertainties subject to a spectral norm constraint, using the singular value decomposition ... View full abstract»

• ### On Gaussian MIMO BC-MAC Duality With Multiple Transmit Covariance Constraints

Publication Year: 2012, Page(s):2064 - 2078
Cited by:  Papers (60)  |  Patents (1)
| | PDF (467 KB) | HTML

Owing to the special structure of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC), the associated capacity region computation and beamforming optimization problems are typically non-convex, and thus cannot be solved directly. One feasible approach is to consider the respective dual multiple-access channel (MAC) problems, which are easier to deal with due to their convexit... View full abstract»

• ### Base Station Cooperation on the Downlink: Large System Analysis

Publication Year: 2012, Page(s):2079 - 2106
Cited by:  Papers (67)
| | PDF (782 KB) | HTML

This paper considers maximizing the network-wide minimum supported rate in the downlink of a two-cell system, where each base station (BS) is endowed with multiple antennas. This is done for different levels of cell cooperation. At one extreme, we consider single cell processing where the BS is oblivious to the interference it is creating at the other cell. At the other extreme, we consider full c... View full abstract»

• ### On Capacity Scaling of Multi-Antenna Multi-Hop Networks: The Significance of the Relaying Strategy in the “Long Network Limit”

Publication Year: 2012, Page(s):2107 - 2133
Cited by:  Papers (5)  |  Patents (1)
| | PDF (688 KB) | HTML

The sum-capacity C of a static uplink channel with n single-antenna sources and an n-antenna destination is known to scale linearly in n, if the random channel matrix fulfills the conditions for the Marcenko-Pastur law: if each source transmits at power P/n, there exists a positive cο, such that limn → ∞ C/n = co almost surely. This ... View full abstract»

• ### Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Publication Year: 2012, Page(s):2134 - 2158
Cited by:  Papers (94)  |  Patents (3)
| | PDF (4720 KB) | HTML

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary k of n nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary d nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of d... View full abstract»

• ### On the Delay-Throughput Tradeoff in Distributed Wireless Networks

Publication Year: 2012, Page(s):2159 - 2174
Cited by:  Papers (6)
| | PDF (464 KB) | HTML

This paper deals with the delay-throughput analysis of a single-hop wireless network with n transmitter/receiver pairs. All channels are assumed to be block Rayleigh fading with shadowing, described by parameters (α, ω̅), where α denotes the probability of shadowing and ω̅ represents the average cross-link gains. The analysis relies on the distributed on-o... View full abstract»

• ### A General Class of Throughput Optimal Routing Policies in Multi-Hop Wireless Networks

Publication Year: 2012, Page(s):2175 - 2193
Cited by:  Papers (10)
| | PDF (853 KB) | HTML

This paper considers the problem of throughput optimal routing/scheduling in a multi-hop constrained queueing network with random connectivity whose special cases include opportunistic multi-hop wireless networks and input-queued switch fabrics. The main challenge in the design of throughput optimal routing policies is closely related to identifying appropriate and universal Lyapunov functions wit... View full abstract»

• ### Series Expansion for Interference in Wireless Networks

Publication Year: 2012, Page(s):2194 - 2205
Cited by:  Papers (23)
| | PDF (2733 KB) | HTML

The spatial correlations in transmitter node locations introduced by common multiple access protocols make the analysis of interference, outage, and other related metrics in a wireless network extremely difficult. Most works therefore assume that nodes are distributed either as a Poisson point process (PPP) or a grid, and utilize the independence properties of the PPP (or the regular structure of ... View full abstract»

• ### Codes Correcting Single Errors of Limited Magnitude

Publication Year: 2012, Page(s):2206 - 2219
Cited by:  Papers (10)
| | PDF (4236 KB) | HTML

An error model with symmetric errors of limited magnitude is considered. Limited magnitude means that the size of any error is limited by a number smaller (usually much smaller) than the alphabet size. Several constructions of codes correcting a single error are given. In some cases, the codes are perfect or quasi- perfect. View full abstract»

• ### Multiple Error-Correcting WOM-Codes

Publication Year: 2012, Page(s):2220 - 2230
Cited by:  Papers (15)  |  Patents (2)
| | PDF (2868 KB) | HTML

A Write Once Memory (WOM) is a storage medium with binary memory elements, called cells, that can change from the zero state to the one state only once. Examples of WOMs include punch cards and optical disks. WOM-codes, introduced by Rivest and Shamir, permit the reuse of a WOM by taking into account the location of cells that have already been changed to the one state. The objective in designing ... View full abstract»

• ### Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes

Publication Year: 2012, Page(s):2231 - 2236
Cited by:  Papers (8)
| | PDF (1658 KB) | HTML

Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. In this paper, three types of generalized cyclotomy of order two are described and three classes of cyclic codes of length n1 n2 and dimension (n1 n2 + 1)/2 are presented and analyzed, wh... View full abstract»

• ### On the Dual of Certain Ternary Weakly Regular Bent Functions

Publication Year: 2012, Page(s):2237 - 2243
Cited by:  Papers (14)
| | PDF (2022 KB) | HTML

In 2006, Helleseth and Kholosha conjectured and partially proved the existence of a class of ternary weakly regular monomial bent functions and also the expression for the dual bent function up to the sign value. The bentness was finally proved later in 2009 using a complicated technique that employs Stickelberger's theorem. Extensively using the previously found results and approaches, in this pa... View full abstract»

• ### Moment Balancing Templates for $(d,k)$-Constrained Codes and Run-Length Limited Sequences

Publication Year: 2012, Page(s):2244 - 2252
Cited by:  Papers (2)
| | PDF (226 KB) | HTML

The first-order moment of (d, k)-constrained codes is investigated in this paper. A generalized moment balancing template is proposed to encode a (d, k) sequence into a single insertion or deletion correcting codeword without losing the constraint property. By relocating 0's in moment balancing runs, which appear in a pairwise manner of a (d, k) sequence, the first-order moment of this sequence ca... View full abstract»

• ### Classification of Extremal and $s$-Extremal Binary Self-Dual Codes of Length 38

Publication Year: 2012, Page(s):2253 - 2262
Cited by:  Papers (5)
| | PDF (272 KB) | HTML

In this paper we classify all extremal and s-extremal binary self-dual codes of length 38. There are exactly 2744 extremal self-dual codes, two s-extremal codes, and 1730 s-extremal codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalization of this recursive algorithm for the shadow. T... View full abstract»

• ### A Note About Two-Weight Non-Irreducible Cyclic Codes

Publication Year: 2012, Page(s):2263 - 2264
Cited by:  Papers (2)
| | PDF (86 KB) | HTML

A class of two-weight non-irreducible cyclic codes was recently presented by Ma . This class of codes generalizes and extends some of the codes presented in papers by Wolfmann in 2005 and Vega and Wolfman in 2007. The aim of this note is to show that the class of codes presented by Ma is properly contained in a superclass of two-weight cyclic codes that was introduced by Vega in 2008. View full abstract»

• ### Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth

Publication Year: 2012, Page(s):2265 - 2279
Cited by:  Papers (34)
| | PDF (3248 KB) | HTML

The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Using the principle of tailbiting, compact representations of bipartite graphs based on convolutional codes can be found. Bounds on the girth and the minimum distance of LDPC block codes constructed in s... View full abstract»

• ### On the Construction of Structured LDPC Codes Free of Small Trapping Sets

Publication Year: 2012, Page(s):2280 - 2302
Cited by:  Papers (50)
| | PDF (718 KB) | HTML

We present a method to construct low-density parity-check (LDPC) codes with low error floors on the binary symmetric channel. Codes are constructed so that their Tanner graphs are free of certain small trapping sets. These trapping sets are selected from the trapping set ontology for the Gallager A/B decoder. They are selected based on their relative harmfulness for a given decoding algorithm. We ... View full abstract»

• ### Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels

Publication Year: 2012, Page(s):2303 - 2320
Cited by:  Papers (69)
| | PDF (4312 KB) | HTML

We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code ensembles that exhibit good performance with the windowed decoder. We will consider the performance of these ensembles and codes over erasure channels with and wi... View full abstract»

• ### Fixed Initialization Decoding of LDPC Codes Over a Binary Symmetric Channel

Publication Year: 2012, Page(s):2321 - 2329
Cited by:  Papers (3)
| | PDF (2247 KB) | HTML

We introduce in this paper the concept of a correctable error set and a fixed initialization decoding, by noticing that the sum-product decoder with a given iteration number only depends on the initialized probability of error, for a BSC. Although this value has been conventionally selected as the BSC crossover probability, we show that other selections can provide better performance or faster con... View full abstract»

• ### On Coding for Delay—Network Coding for Time-Division Duplexing

Publication Year: 2012, Page(s):2330 - 2348
Cited by:  Papers (30)  |  Patents (2)
| | PDF (1229 KB) | HTML

In networks with large latency, feedback about received packets may lag considerably the transmission of the original packets, limiting the feedback's usefulness. Moreover, time duplex constraints may entail that receiving feedback may be costly. In this work, we consider tailoring feedback and coding jointly in such settings to reduce the expected delay for successful in order reception of packet... 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