IEEE Transactions on Information Theory

Filter Results

Displaying Results 1 - 25 of 44

Publication Year: 2006, Page(s):c1 - c4
| PDF (42 KB)
• IEEE Transactions on Information Theory publication information

Publication Year: 2006, Page(s): c2
| PDF (38 KB)
• On the Distributed Compression of Quantum Information

Publication Year: 2006, Page(s):4349 - 4357
Cited by:  Papers (7)
| | PDF (259 KB) | HTML

The problem of distributed compression for correlated quantum sources is considered. The classical version of this problem was solved by Slepian and Wolf, who showed that distributed compression could take full advantage of redundancy in the local sources created by the presence of correlations. Here it is shown that, in general, this is not the case for quantum sources, by proving a lower bound o... View full abstract»

• Slepian-Wolf Coded Nested Lattice Quantization for Wyner-Ziv Coding: High-Rate Performance Analysis and Code Design

Publication Year: 2006, Page(s):4358 - 4379
Cited by:  Papers (37)  |  Patents (1)
| | PDF (1646 KB) | HTML

Nested lattice quantization provides a practical scheme for Wyner-Ziv coding. This paper examines the high-rate performance of nested lattice quantizers and gives the theoretical performance for general continuous sources. In the quadratic Gaussian case, as the rate increases, we observe an increasing gap between the performance of finite-dimensional nested lattice quantizers and the Wyner-Ziv dis... View full abstract»

• Source Coding for Quasiarithmetic Penalties

Publication Year: 2006, Page(s):4380 - 4393
Cited by:  Papers (14)
| | PDF (443 KB) | HTML

Whereas Huffman coding finds a prefix code minimizing mean codeword length for a given finite-item probability distribution, quasiarithmetic or quasilinear coding problems have the goal of minimizing a generalized mean of the form rho-1(Sigmaipirho(li )), where li denotes the length of the ith codeword, p i denotes the corresponding... View full abstract»

• On Divergences and Informations in Statistics and Information Theory

Publication Year: 2006, Page(s):4394 - 4412
Cited by:  Papers (123)
| | PDF (526 KB) | HTML

The paper deals with the f-divergences of Csiszar generalizing the discrimination information of Kullback, the total variation distance, the Hellinger divergence, and the Pearson divergence. All basic properties of f-divergences including relations to the decision errors are proved in a new manner replacing the classical Jensen inequality by a new generalized Taylor expansion of convex functions. ... View full abstract»

• A Random Linear Network Coding Approach to Multicast

Publication Year: 2006, Page(s):4413 - 4430
Cited by:  Papers (1286)  |  Patents (34)
| | PDF (484 KB) | HTML

We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the code length. We also demonstrate that random ... View full abstract»

• Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes

Publication Year: 2006, Page(s):4431 - 4443
Cited by:  Papers (11)
| | PDF (456 KB) | HTML

In this paper, we present new ways of describing and constructing linear tail-biting trellises for block codes. We extend the well-known Bahl-Cocke-Jelinek-Raviv (BCJR) construction for conventional trellises to tail-biting trellises. The BCJR-like labeling scheme yields a simple specification for the tail-biting trellis for the dual code, with the dual trellis having the same state-complexity pro... View full abstract»

• Determination of the Local Weight Distribution of Binary Linear Block Codes

Publication Year: 2006, Page(s):4444 - 4454
Cited by:  Papers (1)
| | PDF (491 KB) | HTML

Some methods to determine the local weight distribution of binary linear codes are presented. Two approaches are studied: A computational approach and a theoretical approach. For the computational approach, an algorithm for computing the local weight distribution of codes using the automorphism group of the codes is devised. In this algorithm, a code is considered the set of cosets of a subcode, a... View full abstract»

• Weights Modulo a Prime Power in Divisible Codes and a Related Bound

Publication Year: 2006, Page(s):4455 - 4463
Cited by:  Papers (30)
| | PDF (218 KB) | HTML

In this paper, we generalize the theorem given by R. M. Wilson about weights modulo pt in linear codes to a divisible code version. Using a similar idea, we give an upper bound for the dimension of a divisible code by some divisibility property of its weight enumerator modulo pe. We also prove that this bound implies Ward's bound for divisible codes. Moreover, we see that in ... View full abstract»

• Time-Varying Maximum Transition Run Constraints

Publication Year: 2006, Page(s):4464 - 4480
Cited by:  Papers (5)
| | PDF (600 KB) | HTML

Maximum transition run (MTR) constrained systems are used to improve detection performance in storage channels. Recently, there has been a growing interest in time-varying MTR (TMTR) systems, after such codes were observed to eliminate certain error events and thus provide high coding gain for EnPR4 channels for n=2,3. In this work, TMTR constraints parameterized by a vector, whose coor... View full abstract»

• Low-Density Parity-Check Lattices: Construction and Decoding Analysis

Publication Year: 2006, Page(s):4481 - 4495
Cited by:  Papers (43)
| | PDF (963 KB) | HTML

Low-density parity-check codes (LDPC) can have an impressive performance under iterative decoding algorithms. In this paper we introduce a method to construct high coding gain lattices with low decoding complexity based on LDPC codes. To construct such lattices we apply Construction D', due to Bos, Conway, and Sloane, to a set of parity checks defining a family of nested LDPC codes. For the decodi... View full abstract»

• A New Upper Bound on the Block Error Probability After Decoding Over the Erasure Channel

Publication Year: 2006, Page(s):4496 - 4503
Cited by:  Papers (15)
| | PDF (220 KB) | HTML

Motivated by cryptographic applications, we derive a new upper bound on the block error probability after decoding over the erasure channel. The bound works for all linear codes and is in terms of the generalized Hamming weights. It turns out to be quite useful for Reed-Muller codes for which all the generalized Hamming weights are known whereas the full weight distribution is only partially known... View full abstract»

• Robust Measurement-Based Admission Control Using Markov's Theory of Canonical Distributions

Publication Year: 2006, Page(s):4504 - 4518
Cited by:  Papers (2)
| | PDF (464 KB) | HTML

This paper presents models, algorithms and analysis for measurement-based admission control in network applications in which there is high uncertainty concerning source statistics. In the process it extends and unifies several recent approaches to admission control. A new class of algorithms is introduced based on results concerning Markov's canonical distributions. In addition, a new model is dev... View full abstract»

• A Necessary and Sufficient Condition for the Construction of 2-to-1 Optical FIFO Multiplexers by a Single Crossbar Switch and Fiber Delay Lines

Publication Year: 2006, Page(s):4519 - 4531
Cited by:  Papers (38)
| | PDF (347 KB) | HTML

In this paper, we prove a necessary and sufficient condition for the construction of 2-to-1 optical buffered first-in-first-out (FIFO) multiplexers by a single crossbar switch and fiber delay lines. We consider a feedback system consisting of an (M+2)times(M+2) crossbar switch and M fiber delay lines with delays d1,d2,...,dM. These M fiber delay lines are connected... View full abstract»

• Robust Competitive Estimation With Signal and Noise Covariance Uncertainties

Publication Year: 2006, Page(s):4532 - 4547
Cited by:  Papers (9)
| | PDF (548 KB) | HTML

Robust estimation of a random vector in a linear model in the presence of model uncertainties has been studied in several recent works. While previous methods considered the case in which the uncertainty is in the signal covariance, and possibly the model matrix, but the noise covariance is assumed to be completely specified, here we extend the results to the case where the noise statistics may al... View full abstract»

• Performance of Reduced-Rank Equalization

Publication Year: 2006, Page(s):4548 - 4562
Cited by:  Papers (6)
| | PDF (759 KB) | HTML

We evaluate the performance of reduced-rank equalizers for both single-input single-output (SISO) and multiple-input multiple-output (MIMO) frequency-selective channels. Each equalizer filter is constrained to lie in a Krylov subspace, and can be implemented as a reduced-rank multistage Wiener filter (MSWF). Both reduced-rank linear and decision-feedback equalizers (DFEs) are considered. Our resul... View full abstract»

• Wideband Extended Range-Doppler Imaging and Waveform Design in the Presence of Clutter and Noise

Publication Year: 2006, Page(s):4563 - 4580
Cited by:  Papers (15)
| | PDF (905 KB) | HTML

This paper presents a group-theoretic approach to address the wideband extended range-Doppler target imaging and design of clutter rejecting waveforms. An exact imaging method based on the inverse Fourier transform of the affine group is presented. A Wiener filter is designed in the affine group Fourier transform domain to minimize wideband clutter range-Doppler reflectivity. The Wiener filter is ... View full abstract»

• Maiorana&#8211;McFarland Class: Degree Optimization and Algebraic Properties

Publication Year: 2006, Page(s):4581 - 4594
Cited by:  Papers (14)
| | PDF (435 KB) | HTML

In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinearity value immanent to the original construction me... View full abstract»

• The Eta Pairing Revisited

Publication Year: 2006, Page(s):4595 - 4602
Cited by:  Papers (123)  |  Patents (1)
| | PDF (297 KB) | HTML

In this paper, we simplify and extend the Eta pairing, originally discovered in the setting of supersingular curves by Barreto , to ordinary curves. Furthermore, we show that by swapping the arguments of the Eta pairing, one obtains a very efficient algorithm resulting in a speed-up of a factor of around six over the usual Tate pairing, in the case of curves that have large security parameters, co... View full abstract»

• The Hardness of the Closest Vector Problem With Preprocessing Over$ell_infty$Norm

Publication Year: 2006, Page(s):4603 - 4606
Cited by:  Papers (3)
| | PDF (146 KB) | HTML

We show that the closest vector problem with preprocessing (CVPP) over lscr infin norm (CVPPinfin) is NP-hard. The result is obtained by the reduction from the subset sum problem with preprocessing to CVPPinfin. The reduction also shows the NP-hardness of CVPinfin, which is much simpler than all previously known proofs. In addition, we also give a direct... View full abstract»

• New Design of Low-Correlation Zone Sequence Sets

Publication Year: 2006, Page(s):4607 - 4616
Cited by:  Papers (23)
| | PDF (336 KB) | HTML

In this paper, we present several construction methods for low-correlation zone (LCZ) sequence sets. First, we propose a design scheme for binary LCZ sequence sets with parameters (2n+1-2,M,L,2). In this scheme, we can freely set the LCZ length L and the resulting LCZ sequence sets have the size M, which is almost optimal with respect to Tang, Fan, and Matsufuji bound. Second, given a q... View full abstract»

• Meaningful Information

Publication Year: 2006, Page(s):4617 - 4626
Cited by:  Papers (21)
| | PDF (377 KB) | HTML

The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the object and the information accounting for the remaining accidental information. There can be several ways (model classes) in which the regularity is expressed. Kol... View full abstract»

• Zero-Error Source&#8211;Channel Coding With Side Information

Publication Year: 2006, Page(s):4626 - 4629
Cited by:  Papers (8)
| | PDF (201 KB) | HTML

This correspondence presents a novel application of the theta function defined by Lovasz. The problem of coding for transmission of a source through a channel without error when the receiver has side information about the source is analyzed. Using properties of the Lovasz theta function, it is shown that separate source and channel coding is asymptotically suboptimal in general. By contrast, in th... View full abstract»

• Consistency of the Unlimited BIC Context Tree Estimator

Publication Year: 2006, Page(s):4630 - 4635
Cited by:  Papers (18)
| | PDF (328 KB) | HTML

The Bayesian information criterion (BIC) and Krichevsky- Trofimov (KT) version of minimum description length (MDL) principle are popular in the study of model selection. For order estimation of Markov chains, both are known to be strongly consistent when there is an upper-bound on the order. In the unbounded case, the BIC is also known to be consistent, but the KT estimator is consistent only with... 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