IEEE Transactions on Information Theory

Issue 1 • Jan. 2002

Filter Results

Displaying Results 1 - 25 of 31
  • Editorial: The transactions goes monthly

    Publication Year: 2002, Page(s): 3
    Request permission for commercial reuse | PDF file iconPDF (142 KB) | HTML iconHTML
    Freely Available from IEEE
  • Contributors

    Publication Year: 2002, Page(s):334 - 341
    Request permission for commercial reuse | PDF file iconPDF (200 KB)
    Freely Available from IEEE
  • Error performance analysis for reliability-based decoding algorithms

    Publication Year: 2002, Page(s):287 - 293
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (406 KB) | HTML iconHTML

    The statistical approach proposed by Agrawal and Vardy (see ibid., vol.46, no.1, p.60-83, 2000) to evaluate the error performance of the generalized minimum distance (GMD) decoding is extended to other reliability-based decoding algorithms for binary linear block codes, namely Chase (1972) type, combined GMD and Chase type, and order statistic decoding (OSD). In all cases, tighter and simpler boun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronization recovery of variable-length codes

    Publication Year: 2002, Page(s):219 - 227
    Cited by:  Papers (21)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB) | HTML iconHTML

    The synchronization recovery property of variable-length (VL) codes has been extensively studied. In the paper, the mean error propagation length (MEPL) and the variance of error propagation length (VEPL), which are the secondary performance criteria of a VL code, are introduced to measure the synchronization recovery capability of a VL code. For the same probability distribution, there exist many... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tailbiting codes: bounds and search results

    Publication Year: 2002, Page(s):137 - 148
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB) | HTML iconHTML

    Tailbiting trellis representations of linear block codes with an arbitrary sectionalization of the time axis are studied. The notations of regular and irregular tailbiting codes are introduced and their maximal state complexities are lower-bounded. The asymptotic behavior of the derived bound is investigated. Furthermore, for regular tailbiting codes the product state complexity is lower-bounded. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New binary linear codes from algebraic curves

    Publication Year: 2002, Page(s):285 - 287
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    Many new binary linear codes (compared with Brouwer's (2000) table) are found from a construction based on algebraic curves over finite fields View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the redundancy of trellis lossy source coding

    Publication Year: 2002, Page(s):205 - 218
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (629 KB) | HTML iconHTML

    It is well known that trellis lossy source codes have better performance/complexity tradeoff than block codes, as shown by simulations. This makes the trellis coding technique attractive in practice. To get a better understanding of this fact, this paper studies the redundancy of trellis coding for memoryless sources and compares it with a similar result for block codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes

    Publication Year: 2002, Page(s):123 - 136
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB) | HTML iconHTML

    The well-known uniform error property for signal constellations and codes is extended to encompass information bits. We introduce a class of binary labelings for signal constellations, called bit geometrically uniform (BGU) labelings, for which the uniform bit error property holds, i.e., the bit error probability does not depend on the transmitted signal. Strong connections between the symmetries ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modifications of Patterson-Wiedemann functions for cryptographic applications

    Publication Year: 2002, Page(s):278 - 284
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    Three basic properties of Boolean functions to be useful for cryptographic purposes are balancedness, high algebraic degree, and high nonlinearity. In addition, strict avalanche criteria and propagation characteristics are required for design of S-boxes. We introduce methods to modify the Patterson-Wiedemann (19983, 1990) and bent functions to achieve the above cryptographic properties. In the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multiple insertion/deletion correcting codes

    Publication Year: 2002, Page(s):305 - 308
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    We investigate binary, number-theoretic, bit insertion/deletion correcting codes as pioneered by Levenshtein (1965, 1966, 1989). The weight spectra and Hamming distance properties of single insertion/deletion error-correcting codes are analyzed. These relationships are then extended to investigate codes that can correct multiple random insertions and deletions. From these relationships, new bounds... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DC-free binary convolutional coding

    Publication Year: 2002, Page(s):162 - 173
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (433 KB) | HTML iconHTML

    A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free coding and error-correcting capability simultaneously. The scheme has a simple cascaded structure of the running digital sum (RDS) control encoder and the conventional convolutional encoder. A given sequence becomes DC-free if and only if the absolute RDS value of the sequence is bounded by a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dithered lattice-based quantizers for multiple descriptions

    Publication Year: 2002, Page(s):192 - 204
    Cited by:  Papers (26)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (473 KB) | HTML iconHTML

    Multiple description (MD) source coding is aimed at achieving graceful degradation in reconstruction with respect to losing portions of the code, with the cost of some redundancy. We examine MD schemes which use entropy-coded dithered lattice quantizers (ECDQ). We propose two techniques, one based on successive refinement (SR), and the other a dithered and periodic version of the MID scalar quanti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the performance of belief propagation decoding

    Publication Year: 2002, Page(s):112 - 122
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB) | HTML iconHTML

    We consider Gallager's (1963) soft-decoding (belief propagation) algorithm for decoding low-density parity-check (LDPC) codes, when applied to an arbitrary binary-input symmetric-output channel. By considering the expected values of the messages, we derive both lower and upper bounds on the performance of the algorithm. We also derive various properties of the decoding algorithm, such as a certain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing lexicographic codes with a given trellis complexity

    Publication Year: 2002, Page(s):89 - 100
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (663 KB) | HTML iconHTML

    We generalize constructions of lexicographic codes to produce locally optimal codes with a desired trellis decoding complexity. These constructions are efficient for high-rate codes and provide a means for automated code design. As a byproduct, we improve known bounds on the parameters of lexicodes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum independence and mutual information

    Publication Year: 2002, Page(s):318 - 324
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB) | HTML iconHTML

    If I1, I2, ..., Ik are random Boolean variables and the joint probabilities up to the (k-1)th order are known, the values of the kth-order probabilities maximizing the overall entropy have been defined as the maximum independence estimate.. In this article, some contributions deriving from the definition of maximum independence probabilities are proposed. First, it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power levels and packet lengths in random multiple access

    Publication Year: 2002, Page(s):46 - 58
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    Multiple-power-level ALOHA has been proposed to take advantage of the capture phenomenon in order to improve the throughput of a multiple random access system. We study the effect of the use of multiple transmission power levels and of the corresponding packet lengths on the system throughput and energy efficiency. We prove that the single-power-level system in which all transmit at the maximum al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum signal propagation in depolarizing channels

    Publication Year: 2002, Page(s):276 - 278
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    Let X be an unbiased random bit, let Y be a qubit. whose mixed state depends on X, and let the qubit Z be the result of passing Y through a depolarizing channel, which replaces Y with a completely random qubit with probability p. We measure the quantum mutual information between X and Y by T(X; Y)=S(X)+S(Y)-S(X, Y), where S(...) denotes von Neumann's (1948) entropy. (Since X is a classical bit, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimized turbo codes for delay constrained applications

    Publication Year: 2002, Page(s):293 - 305
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (575 KB) | HTML iconHTML

    We present the results of the optimization applied to the design of interleavers for rate-1/n parallel concatenated convolutional codes (PCCC) tailored to specific recursive systematic convolutional (RSC) constituent codes. The emphasis is on low-latency codes associated with interleavers of block length less than or equal to 160. The error floors of the optimized codes are significantly lower tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A sharp upper bound for the probability of error of the likelihood ratio test for detecting signals in white Gaussian noise

    Publication Year: 2002, Page(s):228 - 238
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (477 KB) | HTML iconHTML

    A new sharp upper bound for the probability of error of the likelihood ratio test is given for the detection in white Gaussian noise of any random vector whose norm is greater than, or equal to, a given value and whose probability of presence is less than, or equal to, one half. Also, a new test for the detection of such vectors is described. This test does not depend on the distribution of the si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Woven convolutional codes .I. Encoder properties

    Publication Year: 2002, Page(s):149 - 161
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB) | HTML iconHTML

    Encoders for convolutional codes with large free distances can be constructed by combining several less powerful convolutional encoders. This paper is devoted to constructions in which the constituent convolutional codes are woven together in a manner that resembles the structure of a fabric. The general construction is called twill and it is described together with two special cases, viz., woven ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the Poor-Verdu upper bound for the channel reliability function

    Publication Year: 2002, Page(s):309 - 313
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    In an earlier work, Poor and Verdu (1995) established an upper bound for the reliability function of arbitrary single-user discrete-time channels with memory. They also conjectured that their bound is tight for all coding rates. We demonstrate via a counterexample involving memoryless binary erasure channels (BECs) that the Poor-Verdu upper bound is not tight at low rates. We conclude by examining... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymmetric multiple description lattice vector quantizers

    Publication Year: 2002, Page(s):174 - 191
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB) | HTML iconHTML

    We consider the design of asymmetric multiple description lattice quantizers that cover the entire spectrum of the distortion profile, ranging from symmetric or balanced to successively refinable. We present a solution to a labeling problem, which is an important part of the construction, along with a general design procedure. The high-rate asymptotic performance of the quantizer is also studied. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds and constructions for ternary constant-composition codes

    Publication Year: 2002, Page(s):101 - 111
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (462 KB) | HTML iconHTML

    The problem of determining the maximum size of a ternary code is considered, under the restriction that each symbol should appear a given number of times in each codeword. Upper and lower bounds on the size of such codes under the Hamming metric are discussed, where the lower bounds follow from constructions of good codes. Some of the results are obtained by explicitly finding codes by computer se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative nonparametric estimation of a log-optimal portfolio selection function

    Publication Year: 2002, Page(s):324 - 333
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (529 KB) | HTML iconHTML

    Let stock market vectors form a stationary ergodic sequence. For fixed d ∈ N, a log-optimal portfolio selection function of the past d observed vectors is iteratively estimated on the basis of a training sequence by use of gradients and nonparametric regression. Strong consistency is obtained under a boundedness and α-mixing condition without further assumptions on the distribu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Links between complexity theory and constrained block coding

    Publication Year: 2002, Page(s):59 - 88
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1207 KB) | HTML iconHTML

    The goal of this paper is to establish links between computational complexity theory and the theory and practice of constrained block coding. In particular, the complexities of several fundamental problems in constrained block coding are precisely classified in terms of the existing complexity-theoretic structure. One type of problem studied is that of designing encoder and decoder circuits using ... View full abstract»

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

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