IEEE Transactions on Information Theory

Issue 2 • Feb. 2004

Filter Results

Displaying Results 1 - 25 of 25
  • Table of contents

    Publication Year: 2004, Page(s):c1 - c4
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • Geometric programming duals of channel capacity and rate distortion

    Publication Year: 2004, Page(s):245 - 258
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    We show that the Lagrange dual problems of the channel capacity problem with input cost and the rate distortion problem are simple geometric programs. Upper bounds on channel capacity and lower bounds on rate distortion can be efficiently generated from their duals. For channel capacity, the geometric programming dual characterization is shown to be equivalent to the minmax Kullback-Leibler (KL) c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reed-Solomon list decoding from a system-theoretic perspective

    Publication Year: 2004, Page(s):259 - 271
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    In this paper, the Sudan-Guruswami approach to list decoding of Reed-Solomon (RS) codes is cast in a system-theoretic framework. With the data, a set of trajectories or time series is associated which is then modeled as a so-called behavior. In this way, a connection is made with the behavioral approach to system theory. It is shown how a polynomial representation of the modeling behavior gives ri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The parallel-Gaussian watermarking game

    Publication Year: 2004, Page(s):272 - 289
    Cited by:  Papers (22)  |  Patents (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    Rates of reliable transmission of hidden information are derived for watermarking problems involving parallel Gaussian sources, which are often used to model host images and audio signals. Constraints are imposed on the average squared-error distortion that can be introduced by the information hider and by the attacker. When distortions are measured with respect to the original host data, the opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on the error probability of block codes based on improvements on de Caen's inequality

    Publication Year: 2004, Page(s):290 - 310
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    New lower bounds on the error probability of block codes with maximum-likelihood decoding are proposed. The bounds are obtained by applying a new lower bound on the probability of a union of events, derived by improving on de Caen's lower bound. The new bound includes an arbitrary function to be optimized in order to achieve the tightest results. Since the optimal choice of this function is known,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary self-dual codes with automorphisms of composite order

    Publication Year: 2004, Page(s):311 - 318
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    In this paper, we present some results concerning a decomposition of binary self-dual codes having an automorphism of an order which is the product of two odd prime numbers. These results are applied to construct self-dual [72,36,12] codes with an automorphism of order 15. Furthermore, it is proved that the automorphism group of a putative binary extremal self-dual [72,36,16] code contains at most... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tight lower bound on the classical communication cost of entanglement dilution

    Publication Year: 2004, Page(s):319 - 327
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Suppose two distant observers, Alice and Bob, share some form of entanglement - quantum correlations - in some bipartite pure quantum states. They may apply local operations and classical communication to convert one form of entanglement to another. Since entanglement is regarded as a resource in quantum information processing, it is an important question to ask how much classical communication, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel

    Publication Year: 2004, Page(s):328 - 331
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    The Gaussian isoperimetric inequality states that among all sets in Rn with prescribed Gaussian measure, the half-spaces have minimal Gaussian perimeter. We apply this result to Voronoi regions of codes in Euclidean space and obtain a surprisingly precise description of how the maximum-likelihood decoding error probability varies as a function of the minimum Euclidean distance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for calculating the exact bit error probability of a binary linear code over the binary symmetric channel

    Publication Year: 2004, Page(s):331 - 337
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    An efficient algorithm for calculating the ith bit error probability of a binary linear code over the binary symmetric channel (BSC) is presented. It is proved that the exact ith bit error probability of maximum-likelihood (ML) decoding, bounded distance decoding, and symbol-wise maximum a posteriori probability (MAP) decoding can be obtained with time complexity O(n2n-k), where n and k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing upper bounds to error probability of soft-decision decoding of Reed-Solomon codes based on the ordered statistics algorithm

    Publication Year: 2004, Page(s):337 - 344
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    This correspondence presents performance analysis of symbol-level soft-decision decoding of q-ary maximum-distance-separable (MDS) codes based on the ordered statistics algorithm. The method we present is inspired by the one recently proposed by Agrawal and Vardy (2000), who approximately evaluate the performance of generalized minimum-distance decoding. The correspondence shows that in our contex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbol error probability for guided scrambling over a recording channel

    Publication Year: 2004, Page(s):344 - 349
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    We derive expressions for the symbol error probabilities for a recording code concatenated with a Reed-Solomon (RS) code. The recording code is structured by a guided scrambling (GS) code for the direct current (DC) suppression in conjunction with a runlength-limited (RLL) code. As for the GS codes, convolutional GS and Galois field (GF) addition GS schemes are examined. As for the RLL codes, two ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper bounds on the number of errors corrected by a convolutional code

    Publication Year: 2004, Page(s):350 - 353
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    We derive upper bounds on the weights of error patterns that can be corrected by a convolutional code with given parameters, or equivalently we give bounds on the code rate for a given set of error patterns. The bounds parallel the Hamming bound for block codes by relating the number of error patterns to the number of distinct syndromes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the second greedy weight for linear codes of dimension at least 4

    Publication Year: 2004, Page(s):354 - 356
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    The maximum of g2 - d2 for linear [n,k,d;q] codes C is studied. Here d2 is the smallest size of the support of a two-dimensional subcode of C and g2 is the smallest size of the support of a two-dimensional subcode of C which contains a codeword of weight d. For codes of dimension 4 or more, upper and lower bounds on the maximum of g2-d2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal self-dual codes over F2×F2 with respect to the Hamming weight

    Publication Year: 2004, Page(s):356 - 358
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    In this paper, we study optimal self-dual codes and type IV self-dual codes over the ring F2×F2 of order 4. We give improved upper bounds on minimum Hamming and Lee weights for such codes. Using the bounds, we determine the highest minimum Hamming and Lee weights for such codes of lengths up to 30. We also construct optimal self-dual codes and type IV self-dual codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circulant based extremal additive self-dual codes over GF(4)

    Publication Year: 2004, Page(s):359 - 366
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB) | HTML iconHTML

    It is well known that the problem of finding stabilizer quantum-error-correcting codes (QECC) is transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to classify the extremal additive circulant self-dual codes of lengths up to 15, and construct good codes for lengths 16≤n≤27. We also classify the extrem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consta-Abelian codes over Galois rings

    Publication Year: 2004, Page(s):367 - 380
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1072 KB) | HTML iconHTML

    We study n-length consta-Abelian codes (a generalization of the well-known Abelian codes and constacyclic codes) over Galois rings of characteristic pa, where n and p are coprime. A twisted discrete Fourier transform (DFT) is used to generalize transform domain results of Abelian and constacyclic codes, to consta-Abelian codes. Further, we characterize consta-Abelian codes invariant und... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On nested convolutional codes and their application to woven codes

    Publication Year: 2004, Page(s):380 - 384
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    Nested convolutional codes are a set of convolutional codes that is derived from a given generator matrix. The structural properties of nested convolutional codes and nested generator matrices are studied. A method to construct the set of all minimal (rational) generator matrices of a given convolutional code is presented. As an example, two different sets of nested convolutional codes are derived... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance metric for codes with a high-order spectral at zero frequency

    Publication Year: 2004, Page(s):385 - 394
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    Sum-variance is a well-known metric for assessing the performance of dc-free codes (first-order spectral- codes), however, as we show in this paper, it is unsuitable for comparing the magnitude of spectral components of high-order spectral- (HOSN) codes at low frequencies. In this paper, we introduce a new performance metric for evaluating the spectrum compression of arbitrarily HOSN codes around ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconciliation of a quantum-distributed Gaussian key

    Publication Year: 2004, Page(s):394 - 400
    Cited by:  Papers (67)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Two parties, Alice and Bob, wish to distill a binary secret key out of a list of correlated variables that they share after running a quantum key distribution (QKD) protocol based on continuous-spectrum quantum carriers. We present a novel construction that allows the legitimate parties to get equal bit strings out of correlated variables by using a classical channel, with as little leaked informa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the almost sure rate of convergence of linear stochastic approximation algorithms

    Publication Year: 2004, Page(s):401 - 409
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    The almost sure rate of convergence of linear stochastic approximation algorithms is analyzed. As the main result, it is demonstrated that their almost sure rate of convergence is equivalent to the almost sure rate of convergence of the averages of their input data sequences. As opposed to most of the existing results on the rate of convergence of stochastic approximation which cover only algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contributors

    Publication Year: 2004, Page(s):410 - 414
    Request permission for commercial reuse | PDF file iconPDF (72 KB)
    Freely Available from IEEE
  • Electronic submission of manuscripts to the IEEE Transactions on Information Theory

    Publication Year: 2004, Page(s): 415
    Request permission for commercial reuse | PDF file iconPDF (21 KB) | HTML iconHTML
    Freely Available from IEEE
  • IEEE Transactions on Information Theory and Its Applications call for papers

    Publication Year: 2004, Page(s): 416
    Request permission for commercial reuse | PDF file iconPDF (475 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory Information for authors

    Publication Year: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (23 KB) | HTML iconHTML
    Freely Available from IEEE

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