IEEE Transactions on Information Theory

Volume 50 Issue 3 • March 2004

Filter Results

Displaying Results 1 - 25 of 27
  • 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
  • On the application of LDPC codes to arbitrary discrete-memoryless channels

    Publication Year: 2004, Page(s):417 - 438
    Cited by:  Papers (83)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (630 KB) | HTML iconHTML

    We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, the second is based on LDPC codes of arbitrary (q-ary) alphabets employing modulo-q addition, as presented by Gallager... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On decoding of low-density parity-check codes over the binary erasure channel

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

    This paper investigates decoding of low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We study the iterative and maximum-likelihood (ML) decoding of LDPC codes on this channel. We derive bounds on the ML decoding of LDPC codes on the BEC. We then present an improved decoding algorithm. The proposed algorithm has almost the same complexity as the standard iterative decodi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interleaver pruning for construction of variable-length turbo codes

    Publication Year: 2004, Page(s):455 - 467
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (393 KB) | HTML iconHTML

    In this paper, we address the issue of pruning (i.e., shortening) a given interleaver in a parallel concatenated convolutional code (PCCC). The principle goal of pruning is that of construction of variable-length and hence delay interleavers with application to PCCC, using the same structure (possibly in hardware) of the interleaver and deinterleaver units. As a side benefit, it is sometimes possi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New covering radius of Reed-Muller codes for t-resilient functions

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

    In this paper, we introduce a new covering radius of RM(r,n) from cryptography viewpoint. It is defined as the maximum distance between t-resilient functions and the rth order Reed-Muller code RM(r,n). We next derive its lower and upper bounds. We further present a table of numerical data of our bounds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-correcting codes and B/sub h/-sequences

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

    We construct error-correcting (nonlinear) binary codes using a construction of Bose and Chowla in additive number theory. Our method extends a construction of Graham and Sloane for constant weight codes. The new codes improve 1028 of the 7168 best known h-error-correcting codes of word length /spl les/512 with 1/spl les/h/spl les/14. We give asymptotical comparisons to shortened Bose-Chaudhuri-Hoc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An orthogonal space-time coded CPM system with fast decoding for two transmit antennas

    Publication Year: 2004, Page(s):486 - 493
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    Trellis-coded space-time (TC-ST) coding for continuous-phase modulation (TC-ST-CPM) was recently proposed by Zhang and Fitz. In this paper, we propose an orthogonal space-time coding for CPM (OST-CPM) systems and two transmit antennas. In the proposed OST-CPM, signals from two transmit antennas at any time t are orthogonal while both of them have continuous phases. Similar to Alamouti's OST coding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic deconvolution over groups

    Publication Year: 2004, Page(s):494 - 510
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (415 KB) | HTML iconHTML

    In this paper, we address a class of inverse problems that are formulated as group convolutions. This is a rich area of research with applications to Radon transform inversion for tomography, wide-band and narrow-band signal processing, inverse rendering in computer graphics, and channel estimation in communications, as well as robotics and polymer science. We present a group-theoretic framework f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity game of public watermarking systems

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

    Watermarking codes are analyzed as a game between two players: an information hider and a decoder, on the one hand, and an attacker on the other hand. It is assumed that the covertext (the original data within which the message is hidden) is drawn from a memoryless stationary source and its realization is available at the information hider only. The information hider is allowed to cause some toler... View full abstract»

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

    Publication Year: 2004, Page(s):525 - 526
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (82 KB) | HTML iconHTML

    We derive the moments of the guesswork , the number of attempts required to correctly guess the output of a random source, for a source determined by a Markov chain via a large deviations type estimate. These moments are related to the Perron-Frobenius eigenvalue of the matrix formed by element-wise powers of the Markov chain's transition matrix. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weighted nonbinary repeat-accumulate codes

    Publication Year: 2004, Page(s):527 - 531
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (289 KB) | HTML iconHTML

    Repeat-accumulate (RA) codes are random-like codes having remarkably good performance over an additive white Gaussian noise (AWGN) channel, like turbo and low-density parity-check (LDPC) codes. In this correspondence, we introduce an ensemble of random codes called "weighted nonbinary repeat-accumulate (WNRA) codes" whose encoder consists of a nonbinary repeater, a weighter, a pseudorandom symbol ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved multicovering bounds from linear inequalities and supercodes

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

    The multicovering radii of a code are natural generalizations of the covering radius in which the goal is to cover all m-tuples of vectors for some m as cheaply as possible. In this correspondence, we describe several techniques for obtaining lower bounds on the sizes of codes achieving a given multicovering radius. Our main method is a generalization of the method of linear inequalities based on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear codes with covering radius 2, 3 and saturating sets in projective geometry

    Publication Year: 2004, Page(s):537 - 541
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    Infinite families of linear codes with covering radius R=2, 3 and codimension tR+1 are constructed on the base of starting codes with codimension 3 and 4. Parity-check matrices of the starting codes are treated as saturating sets in projective geometry that are obtained by computer search using projective properties of objects. Upper bounds on the length function and on the smallest sizes of satur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear codes from narrow ray class groups of algebraic curves

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

    By employing the narrow ray class groups of algebraic curves and the Hurwitz genus formula, we construct a class of linear codes over prime fields with reasonable parameters. In particular, we obtain some new codes compared with Brouwer's table. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the automorphism group of a doubly-even (72,36,16) code

    Publication Year: 2004, Page(s):544 - 547
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    We prove that a putative doubly-even (72,36,16) code has no automorphism of order 3 with fixed points. Moreover, such a code has no automorphism of an odd order greater than 7. Eventually, we prove that 25 and 49 do not divide the order of its automorphism group. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum cyclic and constacyclic codes

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

    Based on classical quaternary constacyclic linear codes, we construct a set of quantum codes with parameters [[(4/sup m/ -1)/3, (4/sup m/ -1)/3 -2(3l + b)m, 4l + b + 2]] where m/spl ges/4, 1/spl les/b/spl les/3, and 12l + 3b < 2 /spl times/ 4/sup /spl lfloor/(m+2)/3/spl rfloor//-1, which are better than the codes in Bierbrauer and Edel (2000). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dentist 2:00On codes with low peak-to-average power ratio for multicode CDMA

    Publication Year: 2004, Page(s):550 - 559
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (349 KB) | HTML iconHTML

    Codes which reduce the peak-to-average power (PAPR) in multicode code-division multiple-access (MC-CDMA) communications systems are systematically studied. The problem of designing such codes is reformulated as a new coding-theoretic problem: codes with low PAPR are ones in which the codewords are far from the first-order Reed-Muller code. Bounds on the tradeoff between rate, PAPR, and error-corre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new class of zero-correlation zone sequences

    Publication Year: 2004, Page(s):559 - 565
    Cited by:  Papers (116)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (237 KB) | HTML iconHTML

    In this correspondence, two new methods for constructing sets of zero-correlation zone (ZCZ) sequences are proposed. These methods are based on perfect sequences and unitary matrices. Compared with previous methods, the proposed methods can generate sets of nonbinary ZCZ sequences having a longer zero-correlation zone. The sequences obtained by these methods are suitable for approximately synchron... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on the state complexity of linear tail-biting trellises

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

    Lower bounds on the state complexity of linear tail-biting trellises are presented. One bound generalizes the total-span bound, while another bound can be regarded as a generalization of the cut-set bound. It is shown by examples that the new bounds may be tighter than any of the existing lower bounds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum-likelihood double differential detection clarified

    Publication Year: 2004, Page(s):572 - 576
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (178 KB) | HTML iconHTML

    The maximum-likelihood detector (MLD), also called the generalized likelihood ratio test (GLRT) detector, for single differential modulation is easy to derive. On the other hand, the MLD problem associated with double differential modulation is much more complicated and solving it was deemed to require a computationally unattractive nonlinear search. Consequently, a simple heuristic detector was u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on density model size testing

    Publication Year: 2004, Page(s):576 - 581
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    Let (F/sub k/)/sub k/spl ges/1/ be a nested family of parametric classes of densities with finite Vapnik-Chervonenkis dimension. Let f be a probability density belonging to F/sub k//sup */, where k/sup */ is the unknown smallest integer such that f/spl isin/F/sub k/. Given a random sample X/sub 1/,...,X/sub n/ drawn from f, an integer k/sub 0//spl ges/1 and a real number /spl alpha//spl isin/(0,1)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outer bounds on the capacity of Gaussian interference channels

    Publication Year: 2004, Page(s):581 - 586
    Cited by:  Papers (181)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    Two outer bounds on the capacity region of the two-user Gaussian interference channel (IFC) are derived. The idea of the first bound is to let a genie give each receiver just enough information to decode both messages. This bound unifies and improves the best known outer bounds of Sato and Carleial. Furthermore, the bound extends to discrete memoryless IFCs and is shown to be equivalent to another... 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):587 - 590
    Request permission for commercial reuse | PDF file iconPDF (64 KB)
    Freely Available from IEEE
  • Electronic submission of manuscripts to the IEEE Transactions on Information Theory

    Publication Year: 2004, Page(s): 591
    Request permission for commercial reuse | PDF file iconPDF (22 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
Alexander Barg

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

email: abarg-ittrans@ece.umd.edu