By Topic

IEEE Transactions on Information Theory

Issue 5 • Sep 1994

Filter Results

Displaying Results 1 - 25 of 48
  • General principles for the algebraic decoding of cyclic codes

    Publication Year: 1994, Page(s):1661 - 1663
    Cited by:  Papers (10)
    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.
  • Six new binary quasi-cyclic codes

    Publication Year: 1994, Page(s):1666 - 1667
    Cited by:  Papers (20)
    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.
  • 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.
  • Block-based eigensystem of the 1±D and 1-D2 partial response channels

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

    We find analytical expressions for the block-based input and output eigenvectors and eigenvalues of the systems with responses 1±d and 1-D2. The input eigenvectors form an orthonormal basis which is the optimum modulator for a channel with that transfer function. The output eigenvectors form an orthonormal basis with the same spectral nulls as the corresponding system. This basis... 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.
  • Data fusion with minimal communication

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

    Two sensors obtain data vectors x and y, respectively, and transmit real vectors m&oarr;1(x) and m&oarr;2(y), respectively, to a fusion center. The authors obtain tight lower bounds on the number of messages (the sum of the dimensions of m&oarr;1 and m&oarr;2) that have to be transmitted for the fusion center to be able to evaluate a given function f&oa... 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.
  • 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.
  • Optimal waveform selection for tracking systems

    Publication Year: 1994, Page(s):1536 - 1550
    Cited by:  Papers (95)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1188 KB)

    Investigates adaptive waveform selection schemes where selection is based on overall target tracking system performance. Optimal receiver assumptions allow the inclusion of transmitted waveform specification parameters in the tracking subsystem defining equations. The authors give explicit expressions for two one-step ahead optimization problems for a single target in white Gaussian noise when the... 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.
  • Dynamic system identification with order statistics

    Publication Year: 1994, Page(s):1474 - 1489
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB)

    Systems consisting of linear dynamic and memory-less nonlinear subsystems are identified. The paper deals with systems in which the nonlinear element is followed by a linear element, as well as systems in which the subsystems are connected in parallel. The goal of the identification is to recover the nonlinearity from noisy input-output observations of the whole system; signals interconnecting 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 (11)
    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.
  • 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.
  • A lower bound on the expected length of one-to-one codes

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

    We show that the expected length of any one-to-one encoding of a discrete random variable X is at least H(X)-log(H(X)+1)-log e and that this bound is asymptotically achievable 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.
  • Maximum likelihood sequence estimation from the lattice viewpoint

    Publication Year: 1994, Page(s):1591 - 1600
    Cited by:  Papers (49)  |  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.
  • The performance of convolutional codes on the block erasure channel using various finite interleaving techniques

    Publication Year: 1994, Page(s):1459 - 1473
    Cited by:  Papers (38)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1252 KB)

    Consider the transmission of a finitely interleaved rate 1/n convolutionally encoded message over a channel with memory having two internal states Ξ0 and Ξ1 where when in state Ξ0, the channel resembles a noiseless binary symmetric channel (BSC), whereas when in state Ξ1, the channel is totally blocked and is well approximated by a binary-inp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symmetry properties of multilevel coded modulation

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

    We consider the geometrical uniformity properties of signal space codes generated by multilevel coded modulation. First we examine multilevel schemes based on 2L-ary PSK signal sets, and we derive conditions on the binary component codes which lead to geometrically uniform signal space codes. Next we study the geometrical uniformity of multilevel schemes based on signal sets having a ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Good multi-T phase codes under bandwidth and complexity constraints

    Publication Year: 1994, Page(s):1699 - 1702
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    Multi-T phase codes are an equivalent realization of multi-h phase codes within the class of continuous phase modulations (CPM). The authors present, in the form of code tables, the results of a systematic search for binary and quaternary multi-T phase codes which maximize the free Euclidean distance under given bandwidth and complexity constraints 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 (27)
    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.
  • On the efficiency of on-line density estimators

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

    An on-line density estimator may be defined to be one where each update, following the arrival of a new data value, may be accomplished after no more than a fixed number of calculations. This definition should also apply to any empirical bandwidth selection rule for such an estimator. Recursive estimators comprise only a special case of on-line estimators, but even there, on-line bandwidth formula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A random coding bound for fixed convolutional codes of rate 1/n

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

    We show that the ensemble average of the block error probability for the ensemble of terminated rate 1/n fixed convolutional codes, used on the binary symmetric channel with a maximum likelihood decoder, is bounded by exp2-NEr(1-K/N), where N=(L+m)n is the block length, L being the message length, K the constraint length, and E r() is the random coding exponent for... 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 (30)  |  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.
  • Joint transmitter-receiver optimization for multi-input multi-output systems with decision feedback

    Publication Year: 1994, Page(s):1334 - 1347
    Cited by:  Papers (91)  |  Patents (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    The joint transmit-receive optimization problem for multiuser communication systems with decision feedback is investigated. It is shown that minimization of the geometric mean-squared error (defined as the determinant of the error covariance matrix) leads to a tractable transmitter optimization problem for general multi-input multi-output decision-feedback systems. Several computational results ar... 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.

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