# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 60

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

Publication Year: 2013, Page(s): C2
| PDF (143 KB)
• ### Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes

Publication Year: 2013, Page(s):3257 - 3268
Cited by:  Papers (6)
| | PDF (2769 KB) | HTML

Folded Reed-Solomon (RS) codes are an explicit family of codes that achieve the optimal tradeoff between rate and list error-correction capability: specifically, for any ε > 0, Guruswami and Rudra presented an nO(1/ ε) time algorithm to list decode appropriate folded RS codes of rate R from a fraction 1-R-ε of errors. The algorithm is based o... View full abstract»

• ### On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes

Publication Year: 2013, Page(s):3269 - 3281
Cited by:  Papers (2)
| | PDF (3504 KB) | HTML

We derive the Wu list-decoding algorithm for generalized Reed-Solomon (GRS) codes by using Gröbner bases over modules and the Euclidean algorithm as the initial algorithm instead of the Berlekamp-Massey algorithm. We present a novel method for constructing the interpolation polynomial fast. We give a new application of the Wu list decoder by decoding irreducible binary Goppa codes up to th... View full abstract»

• ### Localized Error Correction in Projective Space

Publication Year: 2013, Page(s):3282 - 3294
| | PDF (3670 KB) | HTML

In this paper, we extend the localized error correction code introduced by L. A. Bassalygo and coworkers from Hamming space to projective space. For constant dimensional localized error correction codes in projective space, we have a lower bound and an upper bound of the capacity, which are asymptotically tight when z <; x ≤ [( n-z)/2], where x, z View full abstract»

• ### A Classification of Unimodular Lattice Wiretap Codes in Small Dimensions

Publication Year: 2013, Page(s):3295 - 3303
Cited by:  Papers (9)
| | PDF (1779 KB) | HTML

Lattice coding over a Gaussian wiretap channel, where an eavesdropper listens to transmissions between a transmitter and a legitimate receiver, is considered. A new lattice invariant called the secrecy gain is used as a code design criterion for wiretap lattice codes since it was shown to characterize the confusion that a chosen lattice can cause at the eavesdropper: the higher the secrecy gain of... View full abstract»

• ### Codes Against Online Adversaries: Large Alphabets

Publication Year: 2013, Page(s):3304 - 3316
Cited by:  Papers (6)
| | PDF (2865 KB) | HTML

In this paper, we consider the communication of information in the presence of an online adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x=(x1,...,xn) symbol-by-symbol over a communication channel. The adversarial jammer can view the transmitted symbols xi ... View full abstract»

• ### Hybrid Noncoherent Network Coding

Publication Year: 2013, Page(s):3317 - 3331
| | PDF (3487 KB) | HTML

We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a significantly large number of different basis vectors transmitted through the network and when the min-cut of the network is much smaller than the length of the ... View full abstract»

• ### Parity-Check Matrices Separating Erasures From Errors

Publication Year: 2013, Page(s):3332 - 3346
Cited by:  Papers (3)
| | PDF (3916 KB) | HTML

Most decoding algorithms of linear codes, in general, are designed to correct or detect errors. However, many channels cause erasures in addition to errors. In principle, decoding over such channels can be accomplished by deleting the erased symbols and decoding the resulting vector with respect to a punctured code. For any given linear code and any given maximum number of correctable erasures, pa... View full abstract»

• ### A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes

Publication Year: 2013, Page(s):3347 - 3353
Cited by:  Papers (5)
| | PDF (910 KB) | HTML

As in classical coding theory, quantum analogs of low-density parity-check (LDPC) codes have offered good error correction performance and low decoding complexity by employing the Calderbank-Shor-Steane construction. However, special requirements in the quantum setting severely limit the structures such quantum codes can have. While the entanglement-assisted stabilizer formalism overcomes this lim... View full abstract»

• ### Tree-Structure Expectation Propagation for LDPC Decoding Over the BEC

Publication Year: 2013, Page(s):3354 - 3377
Cited by:  Papers (6)
| | PDF (5721 KB) | HTML

We present the tree-structure expectation propagation (Tree-EP) algorithm to decode low-density parity-check (LDPC) codes over discrete memoryless channels (DMCs). Expectation propagation generalizes belief propagation (BP) in two ways. First, it can be used with any exponential family distribution over the cliques in the graph. Second, it can impose additional constraints on the marginal distribu... View full abstract»

• ### Automorphisms of Order $2p$ in Binary Self-Dual Extremal Codes of Length a Multiple of 24

Publication Year: 2013, Page(s):3378 - 3383
Cited by:  Papers (1)
| | PDF (1644 KB) | HTML

Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that gp is a fixed point free involution. If C is extremal of length a multiple of 24, all the involutions are fixed point free, except the Golay Code and eventually putative codes of length 120. Connecting module theoretical properties of a self-d... View full abstract»

• ### There is No Self-Dual $BBZ _{4}$-Linear Code Whose Gray Image Has the Parameters $(72,2^{36},16)$

Publication Year: 2013, Page(s):3384 - 3386
Cited by:  Papers (1)
| | PDF (622 KB) | HTML

It is shown that there is no self-dual BBZ4-linear code whose Gray image has the parameters (72,236,16). View full abstract»

• ### Characterization of Negabent Functions and Construction of Bent-Negabent Functions With Maximum Algebraic Degree

Publication Year: 2013, Page(s):3387 - 3395
Cited by:  Papers (8)
| | PDF (3163 KB) | HTML

We present necessary and sufficient conditions for a Boolean function to be a negabent function for both an even and an odd number of variables, which demonstrates the relationship between negabent functions and bent functions. By using these necessary and sufficient conditions for Boolean functions to be negabent, we obtain that the nega spectrum of a negabent function has at most four values. We... View full abstract»

• ### Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising

Publication Year: 2013, Page(s):3396 - 3433
Cited by:  Papers (43)
| | PDF (9076 KB) | HTML

Compressed sensing posits that, within limits, one can undersample a sparse signal and yet reconstruct it accurately. Knowing the precise limits to such undersampling is important both for theory and practice. We present a formula that characterizes the allowed undersampling of generalized sparse objects. The formula applies to approximate message passing (AMP) algorithms for compressed sensing, w... View full abstract»

• ### Reconstruction From Anisotropic Random Measurements

Publication Year: 2013, Page(s):3434 - 3447
Cited by:  Papers (14)
| | PDF (4317 KB) | HTML

Random matrices are widely used in sparse recovery problems, and the relevant properties of matrices with i.i.d. entries are well understood. This paper discusses the recently introduced restricted eigenvalue (RE) condition, which is among the most general assumptions on the matrix, guaranteeing recovery. We prove a reduction principle showing that the RE condition can be guaranteed by checking th... View full abstract»

• ### Certifying the Restricted Isometry Property is Hard

Publication Year: 2013, Page(s):3448 - 3450
Cited by:  Papers (30)
| | PDF (489 KB) | HTML

This paper is concerned with an important matrix condition in compressed sensing known as the restricted isometry property (RIP). We demonstrate that testing whether a matrix satisfies RIP is NP-hard. As a consequence of our result, it is impossible to efficiently test for RIP provided PNP. View full abstract»

• ### Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds

Publication Year: 2013, Page(s):3451 - 3465
Cited by:  Papers (19)
| | PDF (3552 KB) | HTML

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing. In this paper, the high-dimensional setting is considered. It is shown that if the measurement rate and per-sample signal-to-noise ratio (SNR) are finite constants independent of the length of the vector, then the optimal sparsity... View full abstract»

• ### Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems

Publication Year: 2013, Page(s):3466 - 3474
Cited by:  Papers (37)
| | PDF (2673 KB) | HTML

Nonconvex constraints are valuable regularizers in many optimization problems. In particular, sparsity constraints have had a significant impact on sampling theory, where they are used in compressed sensing and allow structured signals to be sampled far below the rate traditionally prescribed. Nearly, all of the theory developed for compressed sensing signal recovery assumes that samples are taken... View full abstract»

• ### Matched Filtering From Limited Frequency Samples

Publication Year: 2013, Page(s):3475 - 3496
Cited by:  Papers (9)
| | PDF (6422 KB) | HTML

In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-domain samples. We model the output of this “compressive matched filter” as a random process whose mean equals the scaled, shifted autocorrelation function of the template signal. Using tools from the theory... View full abstract»

• ### Stationary Random Fields Arising From Second-Order Partial Differential Equations on Compact Lie Groups

Publication Year: 2013, Page(s):3497 - 3513
| | PDF (3981 KB) | HTML

Wide sense stationary processes are a mainstay of classical signal processing. It is well known that they can be obtained by solving ordinary differential equations with constant coefficients whose right-hand side is a white noise. This paper addresses the extension of this construction to random fields defined on compact Lie groups. On an underlying compact Lie group, the paper studies left invar... View full abstract»

• ### Nonparametric Sequential Signal Change Detection Under Dependent Noise

Publication Year: 2013, Page(s):3514 - 3531
Cited by:  Papers (2)
| | PDF (4018 KB) | HTML

A nonparametric version of the sequential signal detection problem is studied. Our signal model includes a class of time-limited signals for which we collect data in the sequential fashion at discrete points in the presence of correlated noise. For such a setup we introduce a novel signal detection algorithm relying on the postfiltering smooth correction of the classical Whittaker-Shannon interpol... View full abstract»

• ### Linear Coherent Estimation With Spatial Collaboration

Publication Year: 2013, Page(s):3532 - 3553
Cited by:  Papers (13)
| | PDF (6287 KB) | HTML

A power-constrained sensor network that consists of multiple sensor nodes and a fusion center (FC) is considered, where the goal is to estimate a random parameter of interest. In contrast to the distributed framework, the sensor nodes may be partially connected, where individual nodes can update their observations by (linearly) combining observations from other adjacent nodes. The updated observat... View full abstract»

• ### Coset Sum: An Alternative to the Tensor Product in Wavelet Construction

Publication Year: 2013, Page(s):3554 - 3571
Cited by:  Papers (2)
| | PDF (3994 KB) | HTML

A multivariate biorthogonal wavelet system can be obtained from a pair of multivariate biorthogonal refinement masks in multiresolution analysis setup. Some multivariate refinement masks may be decomposed into lower dimensional refinement masks. Tensor product is a popular way to construct a decomposable multivariate refinement mask from lower dimensional refinement masks. We present an alternativ... View full abstract»

• ### Secure Symmetrical Multilevel Diversity Coding

Publication Year: 2013, Page(s):3572 - 3581
Cited by:  Papers (3)
| | PDF (2636 KB) | HTML

Symmetrical multilevel diversity coding (SMDC) is a network compression problem introduced by Roche (1992) and Yeung (1995). In this setting, a simple separate encoding strategy known as superposition coding was shown to be optimal in terms of achieving the minimum sum rate (Roche-Yeung-Hau 1997) and the entire admissible rate region (Yeung-Zhang 1999) of the general problem. This paper considers ... 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