IEEE Transactions on Information Theory

Volume 49 Issue 11 • Nov. 2003

Filter Results

Displaying Results 1 - 25 of 34
  • Algebraic soft-decision decoding of Reed-Solomon codes

    Publication Year: 2003, Page(s):2809 - 2825
    Cited by:  Papers (311)  |  Patents (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1255 KB) | HTML iconHTML

    A polynomial-time soft-decision decoding algorithm for Reed-Solomon codes is developed. This list-decoding algorithm is algebraic in nature and builds upon the interpolation procedure proposed by Guruswami and Sudan(see ibid., vol.45, p.1757-67, Sept. 1999) for hard-decision decoding. Algebraic soft-decision decoding is achieved by means of converting the probabilistic reliability information into... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List decoding from erasures: bounds and code constructions

    Publication Year: 2003, Page(s):2826 - 2833
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (557 KB) | HTML iconHTML

    We consider the problem of list decoding from erasures. We establish lower and upper bounds on the rate of a (binary linear) code that can be list decoded with list size L when up to a fraction p of its symbols are adversarially erased. Such bounds already exist in the literature, albeit under the label of generalized Hamming weights, and we make their connection to list decoding from erasures exp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On /spl Zopf//sub 4/-linear Preparata-like and Kerdock-like codes

    Publication Year: 2003, Page(s):2834 - 2843
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (918 KB) | HTML iconHTML

    We say that a binary code of length n is additive if it is isomorphic to a subgroup of /spl Zopf//sub 2//sup /spl alpha// /spl times/ /spl Zopf//sub 4//sup /spl beta//, where the quaternary coordinates are transformed to binary by means of the usual Gray map and hence /spl alpha/ + 2/spl beta/ = n. In this paper, we prove that any additive extended Preparata (1968) -like code always verifies /spl ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel

    Publication Year: 2003, Page(s):2844 - 2855
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (786 KB) | HTML iconHTML

    We consider the problem of lossy joint source-channel coding in a communication system where the encoder has access to channel state information (CSI) and the decoder has access to side information that is correlated to the source. This configuration combines the Wyner-Ziv (1976) model of pure lossy source coding with side information at the decoder and the Shannon/Gel'fand-Pinsker (1958, 1980) mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On zero-error coding of correlated sources

    Publication Year: 2003, Page(s):2856 - 2873
    Cited by:  Papers (15)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1690 KB) | HTML iconHTML

    The problem of separate zero-error coding of correlated sources is considered. Inner and outer single-letter bounds are established for the achievable rate region, and conditions for their coincidence are investigated. It is shown that successive encoding combined with time sharing is not always an optimal coding strategy. Conditions for its optimality are derived. The inner bound to the achievabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models

    Publication Year: 2003, Page(s):2874 - 2894
    Cited by:  Papers (12)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1533 KB) | HTML iconHTML

    For pt. I see ibid., vol.46, p.755-88 (2000). The concept of context-free grammar (CFG)-based coding is extended to the case of countable-context models, yielding context-dependent grammar (CDG)-based coding. Given a countable-context model, a greedy CDG transform is proposed. Based on this greedy CDG transform, two universal lossless data compression algorithms, an improved sequential context-dep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity and optimal power allocation for fading broadcast channels with minimum rates

    Publication Year: 2003, Page(s):2895 - 2909
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (782 KB) | HTML iconHTML

    We derive the capacity region and optimal power allocation scheme for a slowly fading broadcast channel in which minimum rates must be maintained for each user in all fading states, assuming perfect channel state information at the transmitter and at all receivers. We show that the minimum-rate capacity region can be written in terms of the ergodic capacity region of a broadcast channel with an ef... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kullback-Leibler approximation of spectral density functions

    Publication Year: 2003, Page(s):2910 - 2917
    Cited by:  Papers (91)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (482 KB) | HTML iconHTML

    We introduce a Kullback-Leibler (1968) -type distance between spectral density functions of stationary stochastic processes and solve the problem of optimal approximation of a given spectral density /spl Psi/ by one that is consistent with prescribed second-order statistics. In general, such statistics are expressed as the state covariance of a linear filter driven by a stochastic process whose sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation

    Publication Year: 2003, Page(s):2918 - 2940
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1796 KB) | HTML iconHTML

    We study a multiuser detection system for code-division multiple access (CDMA). We show that applying multistage hard-decision parallel interference cancellation (HD-PIC) significantly improves performance compared to the matched filter system. In (multistage) HD-PIC, estimates of the interfering signals are used iteratively to improve knowledge of the desired signal. We use large deviation theory... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deconvolving multivariate kernel density estimates from contaminated associated observations

    Publication Year: 2003, Page(s):2941 - 2952
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1083 KB) | HTML iconHTML

    We consider the estimation of the multivariate probability density function f(x/sub 1/,...,x/sub p/) of X/sub 1/,...,X/sub p/ of a stationary positively or negatively associated (PA or NA) random process {X/sub i/}/sub i=1//sup /spl infin// from noisy observations. Both ordinary smooth and super smooth noise are considered. Quadratic mean and asymptotic normality results are established. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new construction of 16-QAM Golay complementary sequences

    Publication Year: 2003, Page(s):2953 - 2959
    Cited by:  Papers (69)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (618 KB) | HTML iconHTML

    We present a new construction of 16-QAM Golay sequences of length n = 2/sup m/. The number of constructed sequences is (14 + 12m)(m!/2)4/sup m+1/. When employed as a code in an orthogonal frequency-division multiplexing (OFDM) system; this set of sequences has a peak-to-mean envelope power ratio (PMEPR) of 3.6. By considering two specific subsets of these sequences, we obtain new codes with PMEPR ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequency-coded waveforms for enhanced delay-Doppler resolution

    Publication Year: 2003, Page(s):2960 - 2971
    Cited by:  Papers (13)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (990 KB) | HTML iconHTML

    In this paper, we propose techniques for the construction of frequency-coding sequences that give rise to frequency-coded waveforms having ambiguity functions with a clear area - containing no sidelobes - in a connected region surrounding the main lobe. These constructed sequences are called pushing sequences. First, two important properties of pushing sequences are investigated: the group D/sub 4... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limited-trial Chase decoding

    Publication Year: 2003, Page(s):2972 - 2975
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    Chase decoders permit flexible use of reliability information in algebraic decoding algorithms for error-correcting block codes of Hamming distance d. The least complex version of the original Chase algorithms uses roughly d/2 trials of a conventional binary decoder, after which the best decoding result is selected as the final output. On certain channels, this approach achieves asymptotically the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reed-Solomon codes for correcting phased error bursts

    Publication Year: 2003, Page(s):2975 - 2984
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (515 KB) | HTML iconHTML

    A code structure is introduced that represents a Reed-Solomon (RS) code in two-dimensional format. Based on this structure, a novel approach to multiple error burst correction using RS codes is proposed. For a model of phased error bursts, where each burst can affect one of the columns in a two-dimensional transmitted word, it is shown that the bursts can be corrected using a known multisequence s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the nonexistence of rate-one generalized complex orthogonal designs

    Publication Year: 2003, Page(s):2984 - 2988
    Cited by:  Papers (63)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (301 KB) | HTML iconHTML

    Orthogonal space-time block coding proposed recently by Alamouti (1998) and Tarokh et al. (1999) is a promising scheme for information transmission over Rayleigh-fading channels using multiple transmit antennas due to its favorable characteristics of having full transmit diversity and a decoupled maximum-likelihood (ML) decoding algorithm. Tarokh et al. extended the theory of classical orthogonal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The rate of regular LDPC codes

    Publication Year: 2003, Page(s):2989 - 2992
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (283 KB) | HTML iconHTML

    We find the rate of a typical code from the regular low-density parity-check (LDPC) ensemble. We then show that the rate of a code from the ensemble converges to the design rate in quadratic mean and almost surely. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of the iterative decoding of LDPC and product codes using the Gaussian approximation

    Publication Year: 2003, Page(s):2993 - 3000
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (501 KB) | HTML iconHTML

    We propose a novel density evolution approach to analyze the iterative decoding algorithms of low-density parity-check (LDPC) codes and product codes, based on Gaussian densities. Namely, for these classes of codes we derive a one-dimensional (1D) map whose iterates directly represent the error probability both for the additive white Gaussian noise (AWGN) and the Rayleigh-fading channel. These sim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New binary one-generator quasi-cyclic codes

    Publication Year: 2003, Page(s):3001 - 3005
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    Sixteen new binary quasi-cyclic linear codes improving the best known lower bounds on minimum distance in Brouwer's tables are constructed. The parameters of these codes are [102, 26, 32], [102, 27, 30], [142, 35, 40], [142, 36, 38] [146, 36, 40], [170, 16, 72], [170, 20, 66], [170, 33, 52] [170, 36, 50], [178, 33, 56], [178, 34, 54], [182, 27, 64] [182, 36, 56], [186, 17, 76], [210, 23, 80], [254... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A systematic construction of self-dual codes

    Publication Year: 2003, Page(s):3005 - 3009
    Cited by:  Papers (11)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    A new coding construction scheme of block codes using short base codes and permutations that enables the construction of binary self-dual codes is presented in Cadic et al. (2001) and Carlach et al. (1999, 2000). The scheme leads to doubly-even (resp,. singly-even) self-dual codes provided the base code is a doubly-even self-dual code and the number of permutations is even (resp., odd). We study t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On constant-composition codes over Z/sub q/

    Publication Year: 2003, Page(s):3010 - 3016
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (391 KB) | HTML iconHTML

    A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In this correspondence, we give a lower bound for the maximum size of the q-ary constant-composition codes with minimum distance at least 3. This bound is asymptotically optimal and generalizes the Graham-Sloane bound for binary constant-weigh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isometries for rank distance and permutation group of Gabidulin codes

    Publication Year: 2003, Page(s):3016 - 3019
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    The rank distance was introduced by E.M. Gabidulin (see Probl. Pered. Inform., vol.21, p.1-12, 1985). He determined an upper bound for the minimum rank distance of a code. Moreover, he constructed a class of codes which meet this bound: the so-called Gabidulin codes. We first characterize the linear and semilinear isometries for the rank distance. Then we determine the isometry group and the permu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The minimax distortion redundancy in noisy source coding

    Publication Year: 2003, Page(s):3020 - 3030
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (693 KB) | HTML iconHTML

    Consider the problem of finite-rate filtering of a discrete memoryless process {X/sub i/}/sub i/spl ges/1/ based on its noisy observation sequence {Z/sub i/}/sub i/spl ges/1/, which is the output of a discrete memoryless channel (DMC) whose input is {X/sub i/}/sub i/spl ges/1/. When the distribution of the pairs (X/sub i/,Z/sub i/), P/sub X,Z/, is known, and for a given distortion measure, the sol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?

    Publication Year: 2003, Page(s):3031 - 3037
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (429 KB) | HTML iconHTML

    An entropy-constrained quantizer Q is optimal if it minimizes the expected distortion D(Q) subject to a constraint on the output entropy H(Q). We use the Lagrangian formulation to show the existence and study the structure of optimal entropy-constrained quantizers that achieve a point on the lower convex hull of the operational distortion-rate function D/sub h/(R) = inf/sub Q/{D(Q) : H(Q) /spl les... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound for the detection/isolation delay in a class of sequential tests

    Publication Year: 2003, Page(s):3037 - 3047
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (655 KB) | HTML iconHTML

    We address the problem of minimax detecting and isolating abrupt changes in random signals. The criterion of optimality consists in minimizing the maximum mean detection/isolation delay for a given maximum probability of false isolation and mean time before a false alarm. It seems that such a criterion has many practical applications, especially for safety-critical applications, in monitoring dang... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the linear complexity of nonlinearly filtered PN-sequences

    Publication Year: 2003, Page(s):3047 - 3059
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (766 KB) | HTML iconHTML

    Binary sequences of period 2/sup n/-1 generated by a linear feedback shift register (LFSR) whose stages are filtered by a nonlinear function, f, are studied. New iterative formulas are derived for the calculation of the linear complexity of the output sequences. It is shown that these tools provide an efficient mechanism for controlling the linear complexity of the nonlinearly filtered maximal-len... 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
Alexander Barg

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

email: abarg-ittrans@ece.umd.edu