Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.

# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 48

Publication Year: 2009, Page(s): C1
| PDF (52 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2009, Page(s): C2
| PDF (40 KB)
• ### [Front cover]

Publication Year: 2009, Page(s): 1
| PDF (35 KB)
• ### 2008 IEEE Information Theory Society Paper Award

Publication Year: 2009, Page(s):2 - 3
| PDF (651 KB)
• ### 2008 IEEE Communications Society and Information Theory Society Joint Paper Award

Publication Year: 2009, Page(s):4 - 5
| PDF (609 KB)
• ### The Minimum Distance of Turbo-Like Codes

Publication Year: 2009, Page(s):6 - 15
Cited by:  Papers (17)
| | PDF (228 KB) | HTML

Worst-case upper bounds are derived on the minimum distance of parallel concatenated turbo codes, serially concatenated convolutional codes, repeat-accumulate codes, repeat-convolute codes, and generalizations of these codes obtained by allowing nonlinear and large-memory constituent codes. It is shown that parallel-concatenated turbo codes and repeat-convolute codes with sub-linear memory are asy... View full abstract»

• ### On the Cusick–Cheon Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed–Muller Code

Publication Year: 2009, Page(s):16 - 18
Cited by:  Papers (2)
| | PDF (111 KB) | HTML

In this paper, an amplification of the Cusick-Cheon conjecture on balanced Boolean functions in the cosets of the binary Reed-Muller code RM(k,m) of order k and length 2m, in the cases where k = 1 or k ges (m-1)/2, is proved. View full abstract»

• ### Better Binary List Decodable Codes Via Multilevel Concatenation

Publication Year: 2009, Page(s):19 - 26
Cited by:  Papers (5)
| | PDF (243 KB) | HTML

A polynomial time construction of binary codes with the currently best known tradeoff between rate and error-correction radius is given. Specifically, linear codes over fixed alphabets are constructed that can be list decoded in polynomial time up to the so-called Blokh-Zyablov bound. The work builds upon earlier work by the authors where codes list decodable up to the Zyablov bound (the standard ... View full abstract»

• ### A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel

Publication Year: 2009, Page(s):27 - 32
Cited by:  Papers (1)
| | PDF (460 KB) | HTML

This paper considers the performance, on the binary erasure channel, of low-density parity-check (LDPC) codes without repeated edges in their Tanner graphs. A modification to existing finite-length analysis algorithms is presented for these codes. View full abstract»

• ### Provably Good Codes for Hash Function Design

Publication Year: 2009, Page(s):33 - 45
Cited by:  Papers (3)
| | PDF (331 KB) | HTML

A new technique to lower-bound the minimum distance of certain types of quasi-cyclic codes with large dimension by reducing the problem to lower-bounding the minimum distance of a few significantly smaller codes has been developed. These codes have the property that they have extremely efficient software encoders. Using this technique, it is proved that a code which is similar to the SHA-1 (Secure... View full abstract»

• ### Data Synchronization With Timing: The Variable-Rate Case

Publication Year: 2009, Page(s):46 - 52
| | PDF (162 KB) | HTML

This paper extends the theory of data synchronization with timing for fixed-rate codes, previously developed by the authors, to the variable-rate case. Given a source code, a class of sync-timing codes called variable-rate cascaded (VRC) codes is considered that ldquowrap aroundrdquo the source code in such a way as to enable the decoder to not only resynchronize rapidly when the encoded bits are ... View full abstract»

• ### The Trapping Redundancy of Linear Block Codes

Publication Year: 2009, Page(s):53 - 63
Cited by:  Papers (15)
| | PDF (286 KB) | HTML

We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which quantifies the relationship between the number of redundant rows in any parity-check matrix of a given code and the size of its smallest trapping set. Trapping sets with... View full abstract»

• ### Properties and Applications of Preimage Distributions of Perfect Nonlinear Functions

Publication Year: 2009, Page(s):64 - 69
Cited by:  Papers (2)
| | PDF (162 KB) | HTML

The preimage distributions of perfect nonlinear functions from an Abelian group of order n to an Abelian group of order 3 or 4, respectively, are studied. Based on the properties of the preimage distributions of perfect nonlinear functions from an Abelian group of order 3r to an Abelian group of order 3, the weight distributions of the ternary linear codes C View full abstract»

• ### On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions

Publication Year: 2009, Page(s):70 - 82
Cited by:  Papers (4)
| | PDF (283 KB) | HTML

In this paper, the weight distributions of two classes of linear codes based on all known explicit perfect nonlinear functions from Fqm to itself are determined using a unified approach. All the minimal codewords of these codes are characterized according to their weights, which suggests that their covering structures are determined. Finally, all the minimal access sets of the secret sharin... View full abstract»

• ### Relations Between Random Coding Exponents and the Statistical Physics of Random Codes

Publication Year: 2009, Page(s):83 - 92
Cited by:  Papers (17)
| | PDF (278 KB) | HTML

The partition function pertaining to finite-temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in the plane of rate versus temperature: the ferromagnetic phase, corresponding to correct decoding, the paramagnetic phase, of complete disorder, which is dominated by exponentially many incorrect codewords, and the glassy pha... View full abstract»

• ### Recursive Constructions of Detecting Matrices for Multiuser Coding: A Unifying Approach

Publication Year: 2009, Page(s):93 - 98
Cited by:  Papers (14)
| | PDF (148 KB) | HTML

Detecting matrices are a class of combinatorial objects originated from the coin weighing problem of Soderberg and Shapiro in the early 1960s. In this paper, various known recursive construction techniques for binary, bipolar, and ternary detecting matrices are reexamined in a unifying framework. New, general recursive constructions of detecting matrices, which include previous recursive construct... View full abstract»

• ### Construction of ${BBZ}_4$-Linear Reed–Muller Codes

Publication Year: 2009, Page(s):99 - 104
Cited by:  Papers (5)
| | PDF (201 KB) | HTML

In this paper, new quaternary Plotkin constructions are given and are used to obtain new families of quaternary codes. The parameters of the obtained codes, such as the length, the dimension, and the minimum distance, are studied. Using these constructions, new families of quaternary Reed-Muller (RM) codes are built with the peculiarity that after using the Gray map the obtained Z4-line... View full abstract»

• ### Improvements on Parameters of Algebraic-Geometry Codes From Hermitian Curves

Publication Year: 2009, Page(s):105 - 108
| | PDF (123 KB) | HTML

Using the Vladut-Xing method, we refine a construction of Xu to improve the parameters of algebraic-geometry codes based on Hermitian curves. The parameters of these Hermitian codes are arbitrarily close to the Singleton bound, provided that the length of the code is sufficiently large. We also exhibit a class of Hermitian codes over any finite field BBFq 2 (q > 2) with... View full abstract»

• ### Diversity–Multiplexing Tradeoff in ISI Channels

Publication Year: 2009, Page(s):109 - 135
Cited by:  Papers (32)
| | PDF (751 KB) | HTML

The optimal diversity-multiplexing tradeoff curve for the intersymbol interference (ISI) channel is computed and various equalizers are analyzed using this performance metric. Maximum-likelihood signal decoding (MLSD) and decision feedback equalization (DFE) equalizers achieve the optimal tradeoff without coding, but zero forcing (ZF) and minimum mean-square-error (MMSE) equalizers do not. However... View full abstract»

• ### A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels

Publication Year: 2009, Page(s):136 - 146
Cited by:  Papers (24)  |  Patents (1)
| | PDF (296 KB) | HTML

Iterative processing for linear matrix channels, aka turbo equalization, turbo demodulation, or turbo code-division multiple access (CDMA), has traditionally been addressed as the concatenation of conventional error control codes with the linear (matrix) channel. However, in several situations, such as CDMA, multiple-input-multiple-output (MIMO) channels, orthogonal frequency-division multiplexing... View full abstract»

• ### Network Coding: A Computational Perspective

Publication Year: 2009, Page(s):147 - 157
Cited by:  Papers (22)
| | PDF (605 KB) | HTML

In this work, we study the computational perspective of network coding, focusing on two issues. First, we address the computational complexity of finding a network code for acyclic multicast networks. Second, we address the issue of reducing the amount of computation performed by network nodes. In particular, we consider the problem of finding a network code with the minimum possible number of enc... View full abstract»

• ### Parity Forwarding for Multiple-Relay Networks

Publication Year: 2009, Page(s):158 - 173
Cited by:  Papers (18)
| | PDF (383 KB) | HTML

This paper proposes a relaying strategy for the multiple-relay network in which each relay decodes a selection of transmitted messages by other transmitting terminals, and forwards parities of the decoded codewords. This protocol improves the previously known achievable rate of the decode-and-forward (DF) strategy for multirelay networks by allowing relays to decode only a selection of messages fr... View full abstract»

• ### Analysis of a Mixed Strategy for Multiple Relay Networks

Publication Year: 2009, Page(s):174 - 189
Cited by:  Papers (14)
| | PDF (889 KB) | HTML

Infrastructure-based wireless communications systems as well as ad hoc networks experience a growing importance in present-day telecommunications. An increased density and popularity of mobile terminals poses the question how to exploit wireless networks more efficiently. One possibility is to use relay nodes supporting the end-to-end communication of two nodes. In their landmark pap... View full abstract»

• ### Local Base Station Cooperation Via Finite-Capacity Links for the Uplink of Linear Cellular Networks

Publication Year: 2009, Page(s):190 - 204
Cited by:  Papers (90)
| | PDF (473 KB) | HTML

Cooperative decoding at the base stations (or access points) of an infrastructure wireless network is currently well recognized as a promising approach for intercell interference mitigation, thus enabling high frequency reuse. Deployment of cooperative multicell decoding depends critically on the tolopology and quality of the available backhaul links connecting the base stations. This work studies... View full abstract»

• ### Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach

Publication Year: 2009, Page(s):205 - 222
Cited by:  Papers (76)
| | PDF (693 KB) | HTML

In this paper, we study distributed opportunistic scheduling (DOS) in an ad hoc network, where many links contend for the same channel using random access. In such a network, DOS involves a process of joint channel probing and distributed scheduling. Due to channel fading, the link condition corresponding to a successful channel probing could be either good or poor. In the latter case, further cha... 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