IEEE Transactions on Information Theory

Volume 40 Issue 5 • Sep 1994

Filter Results

Displaying Results 1 - 25 of 48
  • Six new binary quasi-cyclic codes

    Publication Year: 1994, Page(s):1666 - 1667
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Six new quasi-cyclic codes are presented, which improve the lower bounds on the minimum distance for a binary code. A local exhaustive search is used to find these codes and many other quasi-cyclic codes which attain the lower bounds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General principles for the algebraic decoding of cyclic codes

    Publication Year: 1994, Page(s):1661 - 1663
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    This paper provides two theorems for decoding all types of cyclic codes. It is shown that from a polynomial ideal point of view, the decoding problems of cyclic codes are closely related to the monic generators of certain polynomial ideals. This conclusion is also generalized to the decoding problems of algebraic geometry codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On restoring band-limited signals

    Publication Year: 1994, Page(s):1490 - 1503
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (809 KB)

    The problem of reconstruction of band-limited signals from discrete and noisy data is studied. The reconstruction schemes employing cardinal expansions are proposed and their asymptotical properties are examined. In particular, the conditions for the convergence of the mean integrated squared error are found and the rate of convergence is evaluated. The main difference between the proposed reconst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimal transmission of non-Gaussian signals through a noisy channel with feedback

    Publication Year: 1994, Page(s):1624 - 1629
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    This paper is concerned with the optimal transmission of a non-Gaussian signal (a non-Gaussian message) through a channel with Gaussian white noise. The coding is assumed to be linear in the signal, but nonlinear in the observation (the channel output). Also, we assume that the signal is a square integrable process which is independent of the noise. It is shown that the optimal transmission which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal robust signaling with pseudonoise-modulated orthogonal signals

    Publication Year: 1994, Page(s):1619 - 1624
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    It is well known that orthogonal signal sets approach the channel capacity and reliability function of the infinite bandwidth additive white Gaussian noise channel. It is shown that pseudonoise-modulated orthogonal signals play a similar role for the infinite bandwidth Gaussian arbitrarily varying channel View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically robust detection of known signals in nonadditive noise

    Publication Year: 1994, Page(s):1612 - 1619
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    Robust detection of known weak signals of unknown amplitude is considered for a class of combined additive and nonadditive noise models and an asymptotically large set of independent observations. This class includes observation models that may have combinations of multiplicative and signal-dependent noise terms. Sufficient conditions are given for robust detection schemes for cases where the gene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the structure of linear codes with covering radius two and three

    Publication Year: 1994, Page(s):1406 - 1416
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering radius r. All bounds are derived in a uniform way. We employ results from coding theory, some earlier results on covering codes, and combinatorial arguments. We prove the following bounds: l(6, 2)=13, l(7,2)=19, l(8,2)⩾25, l(9,2)⩾34, l(2m-l,2)⩾2m+1 for m⩾3, l(14,2)⩾182... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the correlation structure of the wavelet coefficients of fractional Brownian motion

    Publication Year: 1994, Page(s):1609 - 1612
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    Shows that the interdependence of the discrete wavelet coefficients of fractional Brownian motion, defined by normalized correlation, decays exponentially fast across scales and hyperbolically fast along time View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Suboptimum decoding of decomposable block codes

    Publication Year: 1994, Page(s):1392 - 1405
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    To decode a long block code with a large minimum distance by maximum likelihood decoding is practically impossible because the decoding complexity is simply enormous. However, if a code can be decomposed into constituent codes with smaller dimensions and simpler structure, it is possible to devise a practical and yet efficient scheme to decode the code. This paper investigates a class of decomposa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On two-dimensional spectral realization

    Publication Year: 1994, Page(s):1603 - 1608
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Reconstruction of a spectral density function from a finite set of covariances can be performed by maximizing an entropy functional. The method of the maximum entropy on the mean is used For computing a discrete version of this spectral density and allows one to give a new interpretation of these reconstruction methods. In fact, the authors show that the choice of the entropy is directly related t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytical coding of Gaussian sources

    Publication Year: 1994, Page(s):1639 - 1645
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Several procedures for encoding a stationary Gaussian source are investigated. In contrast to vector quantization by the LBG-algorithm, coding and rate-distortion performance can be described analytically due to the regular structure of the code vectors View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irreducible components of canonical diagrams for spectral nulls

    Publication Year: 1994, Page(s):1375 - 1391
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB)

    Irreducible components of canonical diagrams for spectral null constraints at f=fsk/n are studied, where k and n are integers and fs is the symbol frequency. To identify systematically all irreducible components of the canonical diagrams for first-order spectral nulls at f, we give a set of channel symbol sequences specifying all of them. If n is a prime number, then each seq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation for discrete Markov random fields observed in Gaussian noise

    Publication Year: 1994, Page(s):1600 - 1603
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    A finite state Markov random field is observed in Gaussian noise. Changes of measures are defined under which all random variables of the signal are independent and uniformly distributed over the finite state space and all random variables of the observation are independent and N(0,1). The problem of estimating the most likely signal given the observations is treated in a related form by introduci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Malfunction in the Peterson-Gorenstein-Zierler decoder

    Publication Year: 1994, Page(s):1649 - 1653
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Most versions of the Peterson-Gorenstein-Zierler (PGZ) decoding algorithm are not true bounded distance decoding algorithms in the sense that when a received vector is not in the decoding sphere of any codeword, the algorithm does not always declare a decoding failure. For a t-error-correcting BCH code, if the received vector is at distance i, i⩽t from a codeword in a supercode with BCH distan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on achievable rates for limited bitshift correcting codes

    Publication Year: 1994, Page(s):1443 - 1458
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1196 KB)

    Limited codes (runlength-limited, charge constrained, and so on) capable of correcting shifts of their symbols are considered. The error-correction ability is characterized by the minimal bitshift distance dBS of a code. For a given δ=dBS/n, where n is the code length, the achievable code rate Rα is lower bounded. We prove the existence of codes of rate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new procedure for decoding cyclic and BCH codes up to actual minimum distance

    Publication Year: 1994, Page(s):1364 - 1374
    Cited by:  Papers (32)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    The paper presents a new procedure for decoding cyclic and BCH codes up to their actual minimum distance. It generalizes the Peterson decoding procedure and the procedure of Feng and Tzeng (1991) using nonrecurrent syndrome dependence relations. For a code with actual minimum distance d to correct up to t=[(d-1)/2] errors, the procedure requires a (2t+1)×(2t+1) syndrome matrix with known syn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum likelihood sequence estimation from the lattice viewpoint

    Publication Year: 1994, Page(s):1591 - 1600
    Cited by:  Papers (50)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    Considers the problem of data detection in multilevel lattice-type modulation systems in the presence of intersymbol interference and additive white Gaussian noise. The conventional maximum likelihood sequence estimator using the Viterbi algorithm has a time complexity of O(mν+1) operations per symbol and a space complexity of O(δmν) storage elements, where m is t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric density estimation for classes of positive random variables

    Publication Year: 1994, Page(s):1513 - 1535
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1480 KB)

    A kernel-based density estimator for positive random variables is proposed and analyzed. In particular, a nonparametric estimator is developed which takes advantage of the fact that positive random variables can be represented as the norms of random vectors. By appropriately choosing the dimension of the assumed vector space, the estimator can be structured to exploit a priori knowledge about the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of nonuniform constellations on the Gaussian channel

    Publication Year: 1994, Page(s):1633 - 1638
    Cited by:  Papers (11)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    Testing of high-speed voiceband modems has revealed a significant increase in distortion for points near the perimeter of a QAM signal constellation. This distortion increases with distance from the center of the constellation and limits performance at data rates above 19.2 kb/s. The perimeter distortion can be reduced by transforming the signal constellation so that points near the center are clo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not

    Publication Year: 1994, Page(s):1425 - 1442
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB)

    Let B be the binary two-error-correcting BCH code of length 2m-1 and let Bˆ be the extended code of B. We give formal expressions of weight distributions of the cosets of the codes Bˆ only depending on m. We can then deduce the weight distributions of the cosets of B. When m is odd, it is well known that there are four distinct weight distributions for the cosets of B. So our ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sequential delay estimation in wideband digital communication systems

    Publication Year: 1994, Page(s):1327 - 1333
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    The problem of estimating the symbol timing in wideband data communication signals is considered. Conventional approaches to this problem suffer from several drawbacks, including possible lack of consistency due to multiple extrema in the error surface, and very slow convergence due to exceedingly sharp waveform correlation functions. In the paper sequential detection-estimation algorithms that al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A trellis coded modulation scheme constructed from block coded modulation with interblock memory

    Publication Year: 1994, Page(s):1348 - 1363
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    Proposes a new trellis coded modulation scheme which is constructed by combining a convolutional code and a variation of block coded modulation called block coded modulation with interblock memory. In the proposed scheme, each coded multidimensional signal point has a kind of two-fold dependency on other coded multidimensional signal points. In addition to the dependency on other coded multidimens... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding of convolutional codes using a syndrome trellis

    Publication Year: 1994, Page(s):1663 - 1666
    Cited by:  Papers (40)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    Soft-decision maximum-likelihood decoding of convolutional codes using the Viterbi algorithm with a syndrome trellis is proposed. The parity check matrix of a convolutional code is used to construct the trellis. This trellis is minimal. The number of operations for the decoding of one block of a q-ary rate k/n convolutional code is ~nqmin(k,n-k)qν, where ν is the memory... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the probability of deception in multiple authentication

    Publication Year: 1994, Page(s):1586 - 1591
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    The frequently assumed “freshness” constraint on the source states in multiple authentication schemes is not necessary if one allows the encoding rule to change between subsequent transmissions. In the paper it is shown that the main existing lower bounds on the probabilities of successful attack on multiple authentication schemes also hold for this new setup. Furthermore, Stinson's (1... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of Grobner bases to decode binary cyclic codes up to the true minimum distance

    Publication Year: 1994, Page(s):1654 - 1661
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    A general algebraic method for decoding all types of binary cyclic codes is presented. It is shown that such a method can correct t=[(d-1)/2] errors, where d is the true minimum distance of the given cyclic code. The key idea behind this decoding technique is a systematic application of the algorithmic procedures of Grobner bases to obtain the error-locator polynomial L(z). The discussion begins f... 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