# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 49

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

Publication Year: 2010, Page(s): C2
| |PDF (41 KB)
• ### Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part I: An Algebraic Soft-In Hard-Out Chase Decoder

Publication Year: 2010, Page(s):945 - 959
Cited by:  Papers (18)
| |PDF (448 KB) | HTML

In this paper, we present an algebraic methodology for implementing low-complexity, Chase-type, decoding of Reed-Solomon (RS) codes of length n . In such, a set of 2 ¿¿ test-vectors that are equivalent on all except ¿¿ ¿¿ n coordinate positions is first produced. The similarity of the test-vectors is utilized to reduce the complexity of interpolation, the process of... View full abstract»

• ### Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding

Publication Year: 2010, Page(s):960 - 967
Cited by:  Papers (8)
| |PDF (357 KB) | HTML

In this paper, we present a practical approach to the iterative decoding of Reed-Solomon (RS) codes. The presented methodology utilizes an architecture in which the output produced by steps of belief-propagation (BP) is successively applied to a legacy decoding algorithm. Due to the suboptimal performance of BP conducted on the inherently dense RS parity-check matrix, a method is first provided fo... View full abstract»

• ### Designing Floating Codes for Expected Performance

Publication Year: 2010, Page(s):968 - 978
Cited by:  Papers (6)
| |PDF (342 KB) | HTML

Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of n cells, with each cell in one of q states {0,1,...,q -1}. The cells are used to represent k variable values from an ¿¿-ary alphabet. Cells can move from lower values to higher values easily, but moving any cell from a hig... View full abstract»

• ### Optimal, Systematic, $q$-Ary Codes Correcting All Asymmetric and Symmetric Errors of Limited Magnitude

Publication Year: 2010, Page(s):979 - 983
Cited by:  Papers (25)
| |PDF (141 KB) | HTML

Systematic q-ary (q > 2) codes capable of correcting all asymmetric errors of maximum magnitude l , where l ¿ q - 2, are given. These codes are shown to be optimal. Further, simple encoding/decoding algorithms are described. The proposed code can be modified to design codes correcting all symmetric errors of maximum magnitude l, where l ¿ (q-2)/2. View full abstract»

• ### Optimal Hash Functions for Approximate Matches on the $n$-Cube

Publication Year: 2010, Page(s):984 - 991
Cited by:  Papers (4)
| |PDF (398 KB) | HTML

One way to find near-matches in large datasets is to use hash functions. In recent years locality-sensitive hash functions for various metrics have been given; for the Hamming metric projecting onto k bits is simple hash function that performs well. In this paper, we investigate alternatives to projection. For various parameters hash functions given by complete decoding algorithms for error... View full abstract»

• ### Capacity-Achieving Codes With Bounded Graphical Complexity and Maximum Likelihood Decoding

Publication Year: 2010, Page(s):992 - 1006
Cited by:  Papers (19)
| |PDF (430 KB) | HTML

In this paper, the existence of capacity-achieving codes for memoryless binary-input output-symmetric (MBIOS) channels under maximum-likelihood (ML) decoding with bounded graphical complexity is investigated. Graphical complexity of a code is defined as the number of edges in the graphical representation of the code per information bit and is proportional to the decoding complexity per information... View full abstract»

• ### On the Optimum Distance Profiles About Linear Block Codes

Publication Year: 2010, Page(s):1007 - 1014
Cited by:  Papers (6)
| |PDF (182 KB) | HTML

In this paper, for some linear block codes, two kinds of optimum distance profiles (ODPs) are introduced to consider how to construct and then exclude (or include) the basis codewords one by one while keeping a distance profile as large as possible in a dictionary order (or in an inverse dictionary order, respectively). The aim is to improve fault-tolerant capability by selecting subcodes in commu... View full abstract»

• ### Linear-Time Nearest Point Algorithms for Coxeter Lattices

Publication Year: 2010, Page(s):1015 - 1022
Cited by:  Papers (13)
| |PDF (266 KB) | HTML

The Coxeter lattices are a family of lattices containing many of the important lattices in low dimensions. This includes An, E 7 , E 8 and their duals An*, E 7*, and E 8*. We consider the problem of finding a nearest point in a Coxeter lattice. We describe two new algorithms, one with worst case arithmetic comple... View full abstract»

• ### Some Necessary Conditions for Codes to Be Good for Error Detection

Publication Year: 2010, Page(s):1023 - 1027
| |PDF (124 KB) | HTML

Codes for error detection on a q-ary symmetric channel are studied. Whether a code is good or not for error detection (in the technical sense) depends on the structure of the code. For some combinations of the main parameters length, size, and minimum distance, all code are good and for some other combinations all are ugly (stronger than not good). The purpose of this paper is to give bound... View full abstract»

• ### On the Capacity of the Precision-Resolution System

Publication Year: 2010, Page(s):1028 - 1037
Cited by:  Papers (3)
| |PDF (294 KB) | HTML

Arguably, the most prominent constrained system in storage applications is the (d,k)-run-length limited (RLL) system, where every binary sequence obeys the constraint that every two adjacent 1's are separated by at least d consecutive 0's and at most k consecutive 0's, namely, runs of 0's are length limited. The motivation for the RLL constraint ari... View full abstract»

• ### Burst Decoding of Cyclic Codes Based on Circulant Parity-Check Matrices

Publication Year: 2010, Page(s):1038 - 1047
Cited by:  Papers (7)
| |PDF (258 KB) | HTML

An error-burst correcting algorithm is developed based on a circulant parity-check matrix of a cyclic code. The proposed algorithm is more efficient than error trapping if the code rate is less than about 2/3. It is shown that for any (n, k) cyclic code, there is an n Ã n circulant parity-check matrix such that the algorithm, applied to this matrix, corrects error bursts of lengths up to the erro... View full abstract»

• ### On the Capacity Achieving Covariance Matrix for Rician MIMO Channels: An Asymptotic Approach

Publication Year: 2010, Page(s):1048 - 1069
Cited by:  Papers (74)
| |PDF (610 KB) | HTML

In this paper, the capacity-achieving input covariance matrices for coherent block-fading correlated multiple input multiple output (MIMO) Rician channels are determined. In contrast with the Rayleigh and uncorrelated Rician cases, no closed-form expressions for the eigenvectors of the optimum input covariance matrix are available. Classically, both the eigenvectors and eigenvalues are computed nu... View full abstract»

• ### MIMO Gaussian Channels With Arbitrary Inputs: Optimal Precoding and Power Allocation

Publication Year: 2010, Page(s):1070 - 1084
Cited by:  Papers (122)  |  Patents (1)
| |PDF (736 KB) | HTML

In this paper, we investigate the linear precoding and power allocation policies that maximize the mutual information for general multiple-input-multiple-output (MIMO) Gaussian channels with arbitrary input distributions, by capitalizing on the relationship between mutual information and minimum mean-square error (MMSE). The optimal linear precoder satisfies a fixed-point equation as a function of... View full abstract»

• ### Performance and Complexity Analysis of Infinity-Norm Sphere-Decoding

Publication Year: 2010, Page(s):1085 - 1105
Cited by:  Papers (18)
| |PDF (559 KB) | HTML

Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) norm that is used to conduct the tree traversal step in SD is the l 2 -norm. It was, however, recently observed that using the l Â¿-norm instead reduces the hardware complexity of SD considerably... View full abstract»

• ### Fast Optimal Decoding of Multiplexed Orthogonal Designs by Conditional Optimization

Publication Year: 2010, Page(s):1106 - 1113
Cited by:  Papers (33)
| |PDF (423 KB) | HTML

This paper focuses on conditional optimization as a decoding primitive for high rate space-time codes that are obtained by multiplexing in the spatial and code domains. The approach is a crystallization of the work of Hottinen which applies to space-time codes that are assisted by quasi-orthogonality. It is independent of implementation and is more general in that it can be applied to space-time c... View full abstract»

• ### Optimum Receiver Design and Performance Analysis of Arbitrarily Correlated Rician Fading MIMO Channels With Imperfect Channel State Information

Publication Year: 2010, Page(s):1114 - 1134
Cited by:  Papers (12)  |  Patents (1)
| |PDF (1144 KB) | HTML

The error performance of different types of receivers over an arbitrarily correlated Rician fading MIMO channel is assessed by evaluating the decision metric and the pairwise error probability. The differences are in the way channel state information at the receiver (CSIR) is recovered. We consider: i) a genieaided receiver, based on the perfect knowledge of CSIR; ii) a mismatched receiver, based ... View full abstract»

• ### Orthogonal-Like Space–Time-Coded CPM Systems With Fast Decoding for Three and Four Transmit Antennas

Publication Year: 2010, Page(s):1135 - 1146
Cited by:  Papers (9)
| |PDF (419 KB) | HTML

The Alamouti orthogonal space-time block code for two transmit antennas was designed primarily for QAM and PSK modulations, and we have previously generalized it for the continuous phase modulation (CPM), denoted as OST-CPM, by maintaining the orthogonality (for the fast ML decoding/demodulation) and the phase continuity of two signals from two transmit antennas. In this paper, we design orthogona... View full abstract»

• ### Generic Approach to the Performance Analysis of Correlated Transmit/Receive Diversity MIMO Systems With/Without Co-Channel Interference

Publication Year: 2010, Page(s):1147 - 1157
Cited by:  Papers (6)
| |PDF (570 KB) | HTML

Optimal transmit/receive diversity (TRD) is one of the most important configurations for wireless multiple-input multiple-output (MIMO) systems, due to its good performance and ease of implementation. Though investigated intensively, the performance of optimal TRD in general correlated fading with cochannel interference is still not well understood. Since the optimal TRD's output instantaneous sig... View full abstract»

Publication Year: 2010, Page(s):1158 - 1165
| |PDF (175 KB) | HTML

The capacity of peak-power limited, single-antenna, noncoherent, flat-fading channels with memory is considered. The emphasis is on the capacity pre-log, i.e., on the limiting ratio of channel capacity to the logarithm of the signal-to-noise ratio (SNR), as the SNR tends to infinity. It is shown that, among all stationary and ergodic fading processes of a given spectral distribution function and w... View full abstract»

• ### On the Monotonicity, Log-Concavity, and Tight Bounds of the Generalized Marcum and Nuttall $Q$-Functions

Publication Year: 2010, Page(s):1166 - 1186
Cited by:  Papers (30)
| |PDF (614 KB) | HTML

In this paper, we present a comprehensive study of the monotonicity and log-concavity of the generalized Marcum and Nuttall Q-functions. More precisely, a simple probabilistic method is first given to prove the monotonicity of these two functions. Then, the log-concavity of the generalized Marcum Q-function and its deformations is established with respect to each of the three paramet... View full abstract»

• ### Capacity of Channels With Frequency-Selective and Time-Selective Fading

Publication Year: 2010, Page(s):1187 - 1215
Cited by:  Papers (21)
| |PDF (743 KB) | HTML

This paper finds the capacity of single-user discrete-time channels subject to both frequency-selective and time-selective fading, where the channel output is observed in additive Gaussian noise. A coherent model is assumed where the fading coefficients are known at the receiver. Capacity depends on the first-order distributions of the fading processes in frequency and in time, which are assumed t... View full abstract»

• ### Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes

Publication Year: 2010, Page(s):1216 - 1229
Cited by:  Papers (6)
| |PDF (340 KB) | HTML

A two-dimensional (2-D) grid with dots is called a configuration with distinct differences if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many applications such as radar, sonar, physical alignment, and time-position synchronization. Rather than restricting dots to lie in a square or rectangle, as previous... View full abstract»

• ### On the Nonlinearity of Exponential Welch Costas Functions

Publication Year: 2010, Page(s):1230 - 1238
Cited by:  Papers (7)
| |PDF (302 KB) | HTML

We study the nonlinearity of the exponential Welch Costas functions, using the Fourier transform on Z m. These functions have been proposed for use in nonbinary cryptosystems. High nonlinearity is required to ensure resistance to linear cryptanalysis. We prove some properties of the nonlinearity of these functions, and we suggest a plausible connection of the nonlinearity to the ... 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