# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 34

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

Publication Year: 2007, Page(s): C2
| PDF (38 KB)
• ### Generalized Entropy Power Inequalities and Monotonicity Properties of Information

Publication Year: 2007, Page(s):2317 - 2329
Cited by:  Papers (65)
| | PDF (288 KB) | HTML

New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of n independent random variables to the information contained in sums over subsets of the random variables, for an arbitrary collection of subsets. As a consequence, a simple proof of the monotonicity of information in centr... View full abstract»

• ### On the Estimation of Differential Entropy From Data Located on Embedded Manifolds

Publication Year: 2007, Page(s):2330 - 2341
Cited by:  Papers (24)  |  Patents (1)
| | PDF (544 KB) | HTML

Estimation of the differential entropy from observations of a random variable is of great importance for a wide range of signal processing applications such as source coding, pattern recognition, hypothesis testing, and blind source separation. In this paper, we present a method for estimation of the Shannon differential entropy that accounts for embedded manifolds. The method is based on high-rat... View full abstract»

• ### Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension

Publication Year: 2007, Page(s):2342 - 2348
Cited by:  Papers (10)
| | PDF (178 KB) | HTML

The notion of the evolution of a discrete random source with finite alphabet is introduced and its behavior under the action of an associated linear evolution operator is studied. Viewing these sources as possibly stable dynamical systems it is proved that all random sources with finite evolution dimension are asymptotically mean stationary, which implies that such random sources have ergodic prop... View full abstract»

• ### The Poisson Fading Channel

Publication Year: 2007, Page(s):2349 - 2364
Cited by:  Papers (26)
| | PDF (457 KB) | HTML

In this first paper of a two-part series, a single-user single-input single-output (SISO) shot-noise-limited Poisson channel is considered over which an information signal is transmitted by modulating the intensity of an optical beam, and individual photon arrivals are counted at the photodetector receiver. The transmitted signal, which is chosen to satisfy peak and average constraints, undergoes ... View full abstract»

• ### Sharp Bounds on Generalized EXIT Functions

Publication Year: 2007, Page(s):2365 - 2375
Cited by:  Papers (9)
| | PDF (283 KB) | HTML

We consider communication over binary-input memoryless symmetric channels with low-density parity-check (LDPC) codes. The relationship between maximum a posteriori and belief propagation decoding is investigated using a set of correlation inequalities that first appeared in statistical mechanics of Gaussian spin glasses. We prove bounds on generalized extrinsic information transfer (EXIT) function... View full abstract»

• ### Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes

Publication Year: 2007, Page(s):2376 - 2393
Cited by:  Papers (27)
| | PDF (685 KB) | HTML

We consider coded data transmission over a binary-input output-symmetric memoryless channel using a binary linear code. In order to understand the performance of maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's attention needs to be shifted to the pseudo-codewords, ... View full abstract»

• ### Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes

Publication Year: 2007, Page(s):2394 - 2428
Cited by:  Papers (19)  |  Patents (1)
| | PDF (1130 KB) | HTML

The transmission of coded communication systems is widely modeled to take place over a set of parallel channels. This model is used for transmission over block-fading channels, rate-compatible puncturing of turbo-like codes, multicarrier signaling, multilevel coding, etc. New upper bounds on the maximum-likelihood (ML) decoding error probability are derived in the parallel-channel setting. We focu... View full abstract»

• ### Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

Publication Year: 2007, Page(s):2429 - 2458
Cited by:  Papers (165)  |  Patents (2)
| | PDF (5363 KB) | HTML

In the late 1950s and early 1960s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for hard-decision algebraic decoding, such as Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes. This paper shows that finite fields can also be successfully used to construct algebraic low-density parity-check (LDPC) codes for it... View full abstract»

• ### On the Number of Inequivalent Binary Self-Orthogonal Codes

Publication Year: 2007, Page(s):2459 - 2479
| | PDF (616 KB) | HTML

Let Psi<sub>k,n</sub> denote the number of inequivalent binary self-orthogonal [n, k] codes. We present a method which allows us to compute Psi<sub>k,n</sub> explicitly for a moderate k and an arbitrary n. Included in this paper are explicit formulas for Psi<sub>k,n</sub> with k les 5. View full abstract»

• ### Self-Orthogonality of$q$-Ary Images of$q^{m}$-Ary Codes and Quantum Code Construction

Publication Year: 2007, Page(s):2480 - 2489
Cited by:  Papers (4)
| | PDF (295 KB) | HTML

A code over GF can be imaged or expanded into a code over GF using a basis for the extension field over the base field. The properties of such an image depend on the original code and the basis chosen for imaging. Problems relating the properties of a code and its image with respect to a basis have been of great interest in the field of coding theory. In this work, a generalized version of the pro... View full abstract»

• ### On Space&ndash;Time Coding With Pulse Position and Amplitude Modulations for Time-Hopping Ultra-Wideband Systems

Publication Year: 2007, Page(s):2490 - 2509
Cited by:  Papers (16)  |  Patents (3)
| | PDF (612 KB) | HTML

In this work, we propose novel families of space-time (ST) block codes that can be associated with impulse radio ultra-wideband (IR-UWB) communication systems. The carrier-less nature of this nonconventional totally real transmission technique necessitates the construction of new suitable coding schemes. In fact, the last generation of complex-valued ST codes (namely, the perfect codes) cannot be ... View full abstract»

• ### On Tests for Global Maximum of the Log-Likelihood Function

Publication Year: 2007, Page(s):2510 - 2525
Cited by:  Papers (6)
| | PDF (737 KB) | HTML

Given the location of a relative maximum of the log-likelihood function, how to assess whether it is the global maximum? This paper investigates an existing statistical tool, which, based on asymptotic analysis, answers this question by posing it as a hypothesis testing problem. A general framework for constructing tests for global maximum is given. The characteristics of the tests are investigate... View full abstract»

• ### Signal Sampling and Recovery Under Dependent Errors

Publication Year: 2007, Page(s):2526 - 2541
Cited by:  Papers (9)
| | PDF (484 KB) | HTML

The paper examines the impact of the additive correlated noise on the accuracy of the signal reconstruction algorithm originating from the Whittaker-Shannon (WS) sampling interpolation formula. A class of band-limited signals as well as signals which are non-band-limited are taken into consideration. The proposed reconstruction method is a smooth post-filtering correction of the classical WS inter... View full abstract»

• ### Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes

Publication Year: 2007, Page(s):2542 - 2559
Cited by:  Papers (15)
| | PDF (523 KB) | HTML

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a nonstandard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show ho... View full abstract»

• ### On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes

Publication Year: 2007, Page(s):2560 - 2566
Cited by:  Papers (4)
| | PDF (316 KB) | HTML

Analysis of the Berlekamp-Massey-Sakata algorithm for decoding one-point codes leads to two methods for improving code rate. One method, due to Feng and Rao, removes parity checks that may be recovered by their majority voting algorithm. The second method is to design the code to correct only those error vectors of a given weight that are also geometrically generic. In this work, formulae are give... View full abstract»

• ### The Higher Weight Enumerators of the Doubly-Even, Self-Dual$[48, 24, 12]$Code

Publication Year: 2007, Page(s):2567 - 2571
Cited by:  Papers (5)
| | PDF (478 KB) | HTML

An efficient algorithm is presented for calculating higher weight enumerators of linear codes given generator matrices. By this algorithm, the higher weight enumerators of the unique doubly-even, self-dual code are calculated. The algorithm is based on a previously shown relationship between Tutte polynomials and higher weight enumerators. View full abstract»

• ### On the Existence of Universally Decodable Matrices

Publication Year: 2007, Page(s):2572 - 2575
Cited by:  Papers (11)
| | PDF (197 KB) | HTML

Universally decodable matrices (UDMs) can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers L and N and a prime power q. The main result of this correspondence is that the simple condition L = q + 1 is both necessary and sufficient for (L, N, q)-VDMs to exist. The existence proof is constructive and yields a coding scheme... View full abstract»

• ### A Note on Low-Correlation Zone Signal Sets

Publication Year: 2007, Page(s):2575 - 2581
Cited by:  Papers (27)
| | PDF (346 KB) | HTML

In this correspondence, we present a connection between designing low-correlation zone (LCZ) sequences and the results of correlation of sequences with subfield decompositions presented in a recent book by the first two authors. This results in LCZ signal sets with huge sizes over three different alphabetic sets: finite field of size, integer residue ring modulo , and the subset in the complex fie... View full abstract»

• ### A New Family of Ternary Almost Perfect Nonlinear Mappings

Publication Year: 2007, Page(s):2581 - 2586
Cited by:  Papers (9)
| | PDF (246 KB) | HTML

A mapping f(x) from GF(p<sup>n</sup>) to GF(p<sup>n</sup>) is differentially k-uniform if k is the maximum number of solutions x isin GF(p<sup>n</sup>) of f(x+a) - f(x) = b, where a, b isin GF(p<sup>n</sup>) and a ne 0. A 2-uniform mapping is called almost perfect nonlinear (APN). This correspondence describes new families of ternary APN mappings ove... View full abstract»

• ### Generalized Kasami Sequences: The Large Set

Publication Year: 2007, Page(s):2587 - 2598
Cited by:  Papers (31)
| | PDF (492 KB) | HTML

In this correspondence, new binary sequence families F<sup>k</sup> of period 2<sup>n</sup>-1 are constructed for even n and any k with gcd(k,n)=2 if n/2 is odd or gcd(k,n)=1 if n/2 is even. The distribution of their correlation values is completely determined. These families have maximum correlation 2<sup>n/2+1</sup> and family size 2<sup>3n/2</sup> ... View full abstract»

• ### On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields

Publication Year: 2007, Page(s):2598 - 2605
Cited by:  Papers (11)
| | PDF (351 KB) | HTML

Following the idea of Xing et al., we investigate a general method for constructing families of pseudorandom sequences with low correlation and large linear complexity from elliptic curves over finite fields in this correspondence. With the help of the tool of exponential sums on elliptic curves, we study their periods, linear complexities, linear complexity profiles, distributions of r-patterns, ... View full abstract»

• ### Algebraic Constructions of Optimal Frequency-Hopping Sequences

Publication Year: 2007, Page(s):2606 - 2610
Cited by:  Papers (61)
| | PDF (231 KB) | HTML

Frequency-hopping (FH) spread spectrum and direct-sequence spread spectrum are two main spread-coding technologies. Frequency-hopping sequences are needed in FH code-division multiple-access (CDMA) systems. In this correspondence, three classes of optimal frequency-hopping sequences are constructed with algebraic methods. The three classes are based on perfect nonlinear functions, power functions,... View full abstract»

• ### On Quadratic Bent Functions in Polynomial Forms

Publication Year: 2007, Page(s):2610 - 2615
Cited by:  Papers (21)
| | PDF (245 KB) | HTML

In this correspondence, we construct some new quadratic bent functions in polynomial forms by using the theory of quadratic forms over finite fields. The results improve some previous work. Moreover, we solve a problem left by Yu and Gong in 2006. 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