# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 32

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

Publication Year: 2007, Page(s): C2
| PDF (38 KB)
• ### Networks, Matroids, and Non-Shannon Information Inequalities

Publication Year: 2007, Page(s):1949 - 1969
Cited by:  Papers (113)
| | PDF (508 KB) | HTML

We define a class of networks, called matroidal networks, which includes as special cases all scalar-linearly solvable networks, and in particular solvable multicast networks. We then present a method for constructing matroidal networks from known matroids. We specifically construct networks that play an important role in proving results in the literature, such as the insufficiency of linear netwo... View full abstract»

• ### Interaction in Quantum Communication

Publication Year: 2007, Page(s):1970 - 1982
Cited by:  Papers (8)
| | PDF (326 KB) | HTML

In some scenarios there are ways of conveying information with many fewer, even exponentially fewer, qubits than possible classically. Moreover, some of these methods have a very simple structure-they involve only few message exchanges between the communicating parties. It is therefore natural to ask whether every classical protocol may be transformed to a "simpler" quantum protocol-one that has s... View full abstract»

• ### On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability

Publication Year: 2007, Page(s):1983 - 2009
Cited by:  Papers (35)  |  Patents (4)
| | PDF (644 KB) | HTML

We consider a multiple-input multiple-output (MIMO) wideband Rayleigh block-fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute the capacity and analyze its dependence on coherence length, number of antennas and receive signal-to-noise ratio (SNR) per degree of freedom. We establish condit... View full abstract»

• ### Multiple-Antenna Signaling Over Fading Channels With Estimated Channel State Information: Performance Analysis

Publication Year: 2007, Page(s):2010 - 2027
Cited by:  Papers (1)
| | PDF (544 KB) | HTML

Multiple-antenna concepts for wireless communication systems promise high spectral efficiency and low error rates by proper exploitation of the randomness in multipath propagation. In this paper, we investigate the impact of channel uncertainty caused by channel estimation errors on the error rate performance. We consider a training-based multiple-antenna system that reserves a portion of time to ... View full abstract»

• ### Multiple-Antenna Signaling Over Fading Channels With Estimated Channel State Information: Capacity Analysis

Publication Year: 2007, Page(s):2028 - 2043
Cited by:  Papers (17)
| | PDF (1709 KB) | HTML

Multiple-antenna concepts for wireless communication systems promise high spectral efficiencies and improved error rate performance by proper exploitation of the randomness in multipath propagation. In this paper, we investigate the impact of channel uncertainty caused by channel estimation errors on the capacity of Rayleigh and Ricean block-fading channels. We consider a training-based multiple-a... View full abstract»

• ### Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime

Publication Year: 2007, Page(s):2044 - 2059
Cited by:  Papers (59)
| | PDF (685 KB) | HTML

This paper deals with throughput scaling laws for random ad hoc wireless networks in a rich scattering environment. We develop schemes to optimize the ratio lambda(n) of achievable network sum capacity to the sum of the point-to-point capacities of source-destinations (S-D) pairs operating in isolation. Our focus in this paper is on fixed signal-to-noise ratio (SNR) networks, i.e., networks where ... View full abstract»

• ### New Protocol Sequences for Random-Access Channels Without Feedback

Publication Year: 2007, Page(s):2060 - 2071
Cited by:  Papers (32)
| | PDF (264 KB) | HTML

With recent developments in ad hoc networks and sensor networks, random-access protocol without feedback is a technique that deserves a closer look. This paper is based on Massey's model on random-access channel without feedback. A central concept of this model is the idea of protocol sequences. For these sequences, it is desirable that their cross correlation should be as low as possible and that... View full abstract»

• ### A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding

Publication Year: 2007, Page(s):2072 - 2087
Cited by:  Papers (3)
| | PDF (577 KB) | HTML

A partial ordering on general finite-state Markov channels is given, which orders the channels in terms of probability of symbol error under iterative estimation decoding of a low-density parity-check (LDPC) code. This result is intended to mitigate the complexity of characterizing the performance of general finite-state Markov channels, which is difficult due to the large parameter space of this ... View full abstract»

• ### Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

Publication Year: 2007, Page(s):2088 - 2115
Cited by:  Papers (42)
| | PDF (2418 KB) | HTML

This paper introduces ensembles of systematic accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity, per information bit, of encoding and decoding. It also introduces symmetry properties which play a central role in the construction of new capacity-achieving ensembles for the BEC. The results here improve on the t... View full abstract»

• ### Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective

Publication Year: 2007, Page(s):2116 - 2132
Cited by:  Papers (48)  |  Patents (2)
| | PDF (1970 KB) | HTML

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are important because they admit analytical designs and simple, practical hardware implementation. The spread factor of an interleaver is a common measure for turbo coding applications. Maximum-spread interleavers are interleavers whose spread factors achieve the upper bound. An infini... View full abstract»

• ### Vector Gaussian Multiple Description With Individual and Central Receivers

Publication Year: 2007, Page(s):2133 - 2153
Cited by:  Papers (48)  |  Patents (1)
| | PDF (488 KB) | HTML

T multiple descriptions of a vector Gaussian source for individual and central receivers are investigated. The sum rate of the descriptions with covariance distortion measure constraints, in a positive semidefinite ordering, is exactly characterized. For two descriptions, the entire rate region is characterized. The key component of the solution is a novel information-theoretic inequality that is ... View full abstract»

• ### Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source

Publication Year: 2007, Page(s):2154 - 2179
Cited by:  Papers (43)
| | PDF (545 KB) | HTML

In this work, we consider a source coding model with feed-forward. We analyze a system with a noiseless, feed-forward link where the decoder has knowledge of all previous source samples while reconstructing the present sample. The rate-distortion function for an arbitrary source with feed-forward is derived in terms of directed information, a variant of mutual information. We further investigate t... View full abstract»

• ### Dynamic Model Selection With its Applications to Novelty Detection

Publication Year: 2007, Page(s):2180 - 2189
Cited by:  Papers (11)  |  Patents (1)
| | PDF (392 KB) | HTML

We are concerned with the issue of dynamically selecting optimal statistical models from time series. The goal is not to select a single optimal model over the data as in conventional model selection, but to select a time series of optimal models under the assumption that the data source may be nonstationary. We call this issue dynamic model selection (DMS). From the standpoint of minimum descript... View full abstract»

• ### Characterization of Zak Space Support of a Discrete Chirp

Publication Year: 2007, Page(s):2190 - 2203
Cited by:  Papers (7)  |  Patents (1)
| | PDF (3116 KB) | HTML

General conditions are derived for an (N=KL2)-point discrete chirp with chirp rate a and carrier frequency b to have minimal support on the LtimesKL Zak transform lattice. Earlier, it has been shown that when the normalized chirp parameters amacr= aK, amacr= aK 2, and 2bmacr = 2bK are integers, the last two of the same parity, then the discrete chirp is supported at KL points... View full abstract»

• ### Estimation of Second-Order Cross-Moments of Generalized Almost-Cyclostationary Processes

Publication Year: 2007, Page(s):2204 - 2228
Cited by:  Papers (17)
| | PDF (2130 KB) | HTML

In this paper, the problem of estimating second-order cross-moments of generalized almost-cyclostationary (GACS) processes is addressed. GACS processes have statistical functions that are almost-periodic functions of time whose (generalized) Fourier series expansions have both frequencies and coefficients that depend on the lag shifts of the processes. The class of such nonstationary processes inc... View full abstract»

• ### A Generic Construction of Cartesian Authentication Codes

Publication Year: 2007, Page(s):2229 - 2235
Cited by:  Papers (28)
| | PDF (187 KB) | HTML

In this paper, a coding-theory construction of Cartesian authentication codes is presented. The construction is a generalization of some known constructions. Within the framework of this generic construction, several classes of authentication codes using certain classes of error-correcting codes are described. The authentication codes presented in this paper are better than known ones with compara... View full abstract»

• ### Characterization of $m$-Sequences of Lengths $2^{2k}-1$ and $2^{k}-1$ With Three-Valued Cross Correlation

Publication Year: 2007, Page(s):2236 - 2245
Cited by:  Papers (13)
| | PDF (269 KB) | HTML

Considered is the distribution of the cross correlation between in-sequences of length 22k -1, where m = 2k, and m-sequences of shorter length 2k -1. New pairs of m -sequences with three-valued cross correlation are found and the complete correlation distribution is determined. Finally, we conjecture that there are no more cases with a three-valued cross correlation apart fro... View full abstract»

• ### Successive Coding in Multiuser Information Theory

Publication Year: 2007, Page(s):2246 - 2254
Cited by:  Papers (15)  |  Patents (1)
| | PDF (389 KB) | HTML

In this correspondence, we show that solutions to the multiple description coding problem and the broadcast channel coding problem share a common encoding procedure: successive source encoding. We use this connection as the basis for establishing connections between the achievable multiple description rate region and Marton's region for broadcast channels. Specifically, we show that Marton's encod... View full abstract»

• ### Information Rates Subject to State Masking

Publication Year: 2007, Page(s):2254 - 2261
Cited by:  Papers (27)
| | PDF (305 KB) | HTML

We consider the problem of rate-R, channel coding with causal/noncausal side information at the transmitter, under an additional requirement of minimizing the amount of information that can be learned from the channel output about the state sequence, which is defined in terms of the mutual information between the state sequence and the channel output sequence. A single-letter characterization is p... View full abstract»

• ### Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing

Publication Year: 2007, Page(s):2261 - 2266
Cited by:  Papers (39)
| | PDF (264 KB) | HTML

In this correspondence, we give an alternative proof of the direct part of the classical-quantum channel coding theorem (the Holevo-Schumacher-Westmoreland (HSW) theorem), using ideas of quantum hypothesis testing. In order to show the existence of good codes, we invoke a limit theorem, relevant to the quantum Stein's lemma, in quantum hypothesis testing as the law of large numbers used in the cla... View full abstract»

• ### Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings

Publication Year: 2007, Page(s):2267 - 2270
Cited by:  Papers (4)
| | PDF (210 KB) | HTML

From a linear block code B over the Galois ring GR(4, m) with a k times n generator matrix and minimum Hamming distance d, a rate-k/n convolutional code over the ring Z4 with squared Euclidean free distance at least 2d and a nonrecursive encoder with memory at most m - 1 is constructed. When the generator matrix of B is systematic, the convolutional encoder is systematic, basic, noncata... View full abstract»

• ### Bounds on the Minimum Homogeneous Distance of the pr-ary Image of Linear Block Codes Over the Galois Ring GR(pr,m)

Publication Year: 2007, Page(s):2270 - 2273
Cited by:  Papers (4)
| | PDF (197 KB) | HTML

In this correspondence, bounds are derived on the minimum homogeneous distance of the image of a linear block code over the Galois ring GR(pr,m), with respect to any basis of GR(pr,m). These bounds depend on the parameters of GR(pr ,m), the minimum Hamming distance of the block code, and the average value of the homogeneous weight applied on the base ring Zopf View full abstract»

• ### Cyclotomic Linear Codes of Order $3$

Publication Year: 2007, Page(s):2274 - 2277
Cited by:  Papers (30)
| | PDF (185 KB) | HTML

In this correspondence, two classes of cyclotomic linear codes over GF(q) of order 3 are constructed and their weight distributions are determined. The two classes are two-weight codes and contain optimal codes. They are not equivalent to irreducible cyclic codes in general when q > 2. 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu