# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 35

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

Publication Year: 2007, Page(s): C2
| PDF (38 KB)
• ### Constrained Information Combining: Theory and Applications for LDPC Coded Systems

Publication Year: 2007, Page(s):1617 - 1643
Cited by:  Papers (9)
| | PDF (1078 KB) | HTML

This paper tightens previous information combining bounds on the performance of iterative decoding of binary low-density parity-check (LDPC) codes over binary-input symmetric-output channels by tracking the probability of erroneous bit in conjunction with mutual information. Evaluation of the new bounds as well as of other known bounds on different LDPC ensembles demonstrates sensitivity of the fi... View full abstract»

• ### Iterative Decoding With Replicas

Publication Year: 2007, Page(s):1644 - 1663
Cited by:  Papers (18)  |  Patents (2)
| | PDF (1162 KB) | HTML

Replica shuffled versions of iterative decoders for low-density parity-check (LDPC) codes and turbo codes are presented. The proposed schemes can converge faster than standard and plain shuffled approaches. Two methods, density evolution and extrinsic information transfer (EXIT) charts, are used to analyze the performance of the proposed algorithms. Both theoretical analysis and simulations show t... View full abstract»

• ### Minimax Universal Decoding With an Erasure Option

Publication Year: 2007, Page(s):1664 - 1675
Cited by:  Papers (13)
| | PDF (338 KB) | HTML

Motivated by applications of rateless coding, decision feedback, and automatic repeat request (ARQ), we study the problem of universal decoding for unknown channels in the presence of an erasure option. Specifically, we harness the competitive minimax methodology developed in earlier studies, in order to derive a universal version of Forney's classical erasure/list decoder, which in the erasure ca... View full abstract»

• ### Constructions of Asymptotically Optimal Space–Frequency Codes for MIMO-OFDM Systems

Publication Year: 2007, Page(s):1676 - 1688
Cited by:  Papers (6)
| | PDF (411 KB) | HTML

Constructions of space-frequency (SF) codes for multiple-input multiple-output (MIMO)-orthogonal frequency-division multiplexing (OFDM) systems with nt transmit antennas and Q subcarriers are considered in this paper. Following the pairwise-error-probability analysis, it is known that in addition to the conventional rank distance criterion, the minimum column distance of (ntt... View full abstract»

• ### Golden Space–Time Trellis Coded Modulation

Publication Year: 2007, Page(s):1689 - 1705
Cited by:  Papers (25)
| | PDF (2408 KB) | HTML

In this paper, we present a multidimensional trellis coded modulation scheme for a high rate 2times2 multiple-input multiple-output (MIMO) system over slow fading channels. Set partitioning of the Golden code is designed specifically to increase the minimum determinant. The branches of the outer trellis code are labeled with these partitions and Viterbi algorithm is applied for trellis decoding. I... View full abstract»

• ### Two-Time-Scale Approximation for Wonham Filters

Publication Year: 2007, Page(s):1706 - 1715
Cited by:  Papers (3)
| | PDF (311 KB) | HTML

This paper is concerned with approximation of Wonham filters. A focal point is that the underlying hidden Markov chain has a large state space. To reduce computational complexity, a two-time-scale approach is developed. Under time scale separation, the state space of the underlying Markov chain is divided into a number of groups such that the chain jumps rapidly within each group and switches occa... View full abstract»

• ### Performance Analysis and Code Design for Minimum Hamming Distance Fusion in Wireless Sensor Networks

Publication Year: 2007, Page(s):1716 - 1734
Cited by:  Papers (13)
| | PDF (674 KB) | HTML

Distributed classification fusion using error-correcting codes (DCFECC) has recently been proposed for wireless sensor networks operating in a harsh environment. It has been shown to have a considerably better capability against unexpected sensor faults than the optimal likelihood fusion. In this paper, we analyze the performance of a DCFECC code with minimum Hamming distance fusion. No assumption... View full abstract»

• ### On the Rate of Convergence of Local Averaging Plug-In Classification Rules Under a Margin Condition

Publication Year: 2007, Page(s):1735 - 1742
Cited by:  Papers (23)  |  Patents (3)
| | PDF (256 KB) | HTML

The rates of convergence of plug-in kernel, partitioning, and nearest neighbors classification rules are analyzed. A margin condition, which measures how quickly the a posteriori probabilities cross the decision boundary, smoothness conditions on the a posteriori probabilities, and boundedness of the feature vector are imposed. The rates of convergence of the plug-in classifiers shown in this pape... View full abstract»

• ### Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class

Publication Year: 2007, Page(s):1743 - 1751
Cited by:  Papers (56)
| | PDF (282 KB) | HTML

For the first time Boolean functions on 9 variables having nonlinearity 241 are discovered, that remained as an open question in literature for almost three decades. Such functions are found by heuristic search in the space of rotation symmetric Boolean functions (RSBFs). This shows that there exist Boolean functions on n (odd) variables having nonlinearity >2n-1-2n-1/2 if... View full abstract»

• ### A New Attack on the Filter Generator

Publication Year: 2007, Page(s):1752 - 1758
Cited by:  Papers (34)
| | PDF (213 KB) | HTML

The filter generator is an important building block in many stream ciphers. The generator consists of a linear feedback shift register of length n that generates an m-sequence of period 2n-1 filtered through a Boolean function of degree d that combines bits from the shift register and creates an output bit zt at any time t. The previous best attacks aimed at reconstructing th... View full abstract»

• ### $N$-Sequence RSNS Ambiguity Analysis

Publication Year: 2007, Page(s):1759 - 1766
Cited by:  Papers (8)  |  Patents (2)
| | PDF (331 KB) | HTML

The robust symmetrical number system (RSNS) is a modular system formed using Nges2 integer sequences and ensures that two successive RSNS vectors (paired terms from all N sequences) differ by only one integer. This integer Gray-code property reduces the possibility of encoding errors and makes the RSNS useful in applications such as folding analog-to-digital converters (ADCs), direction finding an... View full abstract»

• ### Resource Allocation and Quality of Service Evaluation for Wireless Communication Systems Using Fluid Models

Publication Year: 2007, Page(s):1767 - 1777
Cited by:  Papers (68)
| | PDF (328 KB) | HTML

Wireless systems offer a unique mixture of connectivity, flexibility, and freedom. It is therefore not surprising that wireless technology is being embraced with increasing vigor. For real-time applications, user satisfaction is closely linked to quantities such as queue length, packet loss probability, and delay. System performance is therefore related to, not only Shannon capacity, but also qual... View full abstract»

• ### Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines

Publication Year: 2007, Page(s):1778 - 1798
Cited by:  Papers (22)
| | PDF (479 KB) | HTML

One of the most popular approaches for the constructions of optical buffers needed for optical packet switching is to use switched delay lines (SDL). Recent advances in the literature have shown that there exist systematic SDL construction theories for various types of optical buffers, including first-in first-out (FIFO) multiplexers, FIFO queues, priority queues, linear compressors, nonovertaking... View full abstract»

• ### Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments

Publication Year: 2007, Page(s):1799 - 1813
Cited by:  Papers (8)
| | PDF (554 KB) | HTML

We propose a joint source-channel coding algorithm capable of correcting some errors in the popular Lempel-Ziv'77 (LZ'77) scheme without introducing any measurable degradation in the compression performance. This can be achieved because the LZ'77 encoder does not completely eliminate the redundancy present in the input sequence. One source of redundancy can be observed when an LZ'77 phrase has mul... View full abstract»

• ### Carbon Copying Onto Dirty Paper

Publication Year: 2007, Page(s):1814 - 1827
Cited by:  Papers (33)
| | PDF (591 KB) | HTML

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive noise), which is known noncausally to the transmitter but not to any of the receivers. Applications range from wireless multiple-antenna multicasting to robust dirty... View full abstract»

• ### Achievable Error Exponents for the Private Fingerprinting Game

Publication Year: 2007, Page(s):1827 - 1838
Cited by:  Papers (14)
| | PDF (600 KB) | HTML

Fingerprinting systems in the presence of collusive attacks are analyzed as a game between a fingerprinter and a decoder on the one hand, and a coalition of two or more attackers on the other hand. The fingerprinter distributes, to different users, different fingerprinted copies of a host data (covertext), drawn from a memoryless stationary source, embedded with different fingerprints. The coaliti... View full abstract»

• ### An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems

Publication Year: 2007, Page(s):1839 - 1851
Cited by:  Papers (120)
| | PDF (539 KB) | HTML

We prove a new extremal inequality, motivated by the vector Gaussian broadcast channel and the distributed source coding with a single quadratic distortion constraint problems. As a corollary, this inequality yields a generalization of the classical entropy-power inequality (EPI). As another corollary, this inequality sheds insight into maximizing the differential entropy of the sum of two depende... View full abstract»

• ### On the Performance of a Two-User MIMO Downlink System in Heavy Traffic

Publication Year: 2007, Page(s):1851 - 1859
Cited by:  Papers (5)
| | PDF (430 KB) | HTML

A multiple-input multiple-output (MIMO) downlink system in which data is transmitted to two users over a common wireless channel is considered. The channel is assumed to be fixed for all transmissions over the period of interest and the ratio of anticipated average arrival rates for the two users, also known as the relative traffic rate, is the system design parameter. A packet-based traffic model... View full abstract»

• ### On Context-Tree Prediction of Individual Sequences

Publication Year: 2007, Page(s):1860 - 1866
Cited by:  Papers (2)
| | PDF (316 KB) | HTML

Motivated by the evident success of context-tree based methods in lossless data compression, we explore, in this correspondence, methods of the same spirit in universal prediction of individual sequences. By context-tree prediction, we refer to a family of prediction schemes, where at each time instant t, after having observed all outcomes of the data sequence x1,...,xt-1, bu... View full abstract»

• ### Sequential Prediction of Unbounded Stationary Time Series

Publication Year: 2007, Page(s):1866 - 1872
Cited by:  Papers (9)
| | PDF (313 KB) | HTML

A simple on-line procedure is considered for the prediction of a real-valued sequence. The algorithm is based on a combination of several simple predictors. If the sequence is a realization of an unbounded stationary and ergodic random process then the average of squared errors converges, almost surely, to that of the optimum, given by the Bayes predictor. An analog result is offered for the class... View full abstract»

• ### Nonparametric Estimation of Conditional Distributions

Publication Year: 2007, Page(s):1872 - 1879
Cited by:  Papers (7)
| | PDF (363 KB) | HTML

Estimation of conditional distributions is considered. It is assumed that the conditional distribution is either discrete or that it has a density with respect to the Lebesgue measure. Partitioning estimates of the conditional distribution are constructed and results concerning consistency and rate of convergence of the integrated total variation error of the estimates are presented View full abstract»

• ### Decorrelation of Wavelet Coefficients for Long-Range Dependent Processes

Publication Year: 2007, Page(s):1879 - 1883
Cited by:  Papers (10)
| | PDF (279 KB) | HTML

We consider a discrete-time stationary long-range dependent process (Xk)kisinZ such that its spectral density equals phi(|lambda|)-2d, where phi is a smooth function such that phi(0)=phi''(0)=0 and phi(lambda)gesclambda for lambdaisin[0,pi]. Then for any wavelet psi with N vanishing moments, the lag k within-level covariance of wavelet coefficients decays as O(k View full abstract»

• ### New Bounds on the Expected Length of Optimal One-to-One Codes

Publication Year: 2007, Page(s):1884 - 1895
Cited by:  Papers (7)  |  Patents (1)
| | PDF (534 KB) | HTML

In this correspondence, we consider one-to-one encodings for a discrete memoryless source, which are "one-shot" encodings associating a distinct codeword with each source symbol. Such encodings could be employed when only a single source symbol rather than a sequence of source symbols needs to be transmitted. For example, such a situation can arise when the last message must be acknowledged before... 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