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 (19)
    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.
  • The rate-distortion dimension of sets and measures

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

    Data compression of independent samples drawn from a fractal set is considered. The asymptotic ratio of rate to magnitude log distortion characterizes the effective dimension occupied by the underlying distribution. This quantity is shown to be identical to Renyi's (1959) information dimension. For self-similar fractal sets this dimension is distribution dependent-in sharp contrast with the behavi... 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.
  • Optimal waveform selection for tracking systems

    Publication Year: 1994, Page(s):1536 - 1550
    Cited by:  Papers (75)
    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.
  • 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 (25)  |  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.
  • 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.
  • 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.
  • Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not

    Publication Year: 1994, Page(s):1425 - 1442
    Cited by:  Papers (8)
    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.
  • Two new rate 2/p binary quasi-cyclic codes

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

    A class of rate 2/P quasi-cyclic codes can be characterized in terms of m×m circulant matrices. In this correspondence, two new codes with parameters (80, 10, 35) and (95, 10, 42) are presented which improve the known lower bound on the maximum possible minimum distance. The former code can be extended with an even parity check bit to an (81, 10, 36) code that establishes that d2(... 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.
  • Binary coding by integration of polynomials

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

    Based on the idea of integration and differentiation of polynomials, a large class of linear unequal error-protection (LUEP) codes is constructed. Many of these codes are optimal. A codeword is generated by binary discrete integration of an all-zero vector, using the information bits as integration constants. Decoding is performed by discrete differentiation of the received word. For special desig... 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.
  • A determination of the parameters of a large class of Goppa codes

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

    We determine the code parameters of a large class of Goppa codes, constructed from certain curves described by Stichtenoth (see Arch. Math., vol.XXIV, pp.615-631, 1973), in terms of the genus and the Weierstrass gap sequence of a given chosen point on each tune. Examples are codes from Hermitian, Artin-Schreier, and hyperelliptic curves View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modulation and coding for throughput-efficient optical systems

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

    Optical direct-detection systems are currently being considered for some high-speed intersatellite links, where data rates of a few hundred megabits per second are envisioned under power and pulsewidth constraints. The authors investigate the capacity, cutoff rate, and error-probability performance of uncoded and trellis-coded systems for various modulation schemes and under throughput and power c... 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.
  • 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.
  • Estimation for discrete Markov random fields observed in Gaussian noise

    Publication Year: 1994, Page(s):1600 - 1603
    Cited by:  Papers (1)
    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.
  • The Nordstrom-Robinson code: representation over GF(4) and efficient decoding

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

    We show that the Nordstrom-Robinson (1968) code may be represented as the union of binary images of two isomorphic linear (4,2,3) codes over GF(4). Certain symmetries of the unique quaternary (4,2,3) quadracode are discussed. It is shown how the properties of the Nordstrom-Robinson code itself, such as weight distribution, distance invariance, and the well-known representation as the union of eigh... 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.
  • 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.
  • 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.

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
Frank R. Kschischang

Department of Electrical and Computer Engineering