IEEE Transactions on Information Theory

Volume 40 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 (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.
  • 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.
  • 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.
  • A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence

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

    Let s be a periodic sequence whose elements lie in a finite field. The authors present an algorithm that calculates the minimal polynomial of s, assuming that a period of s is known. The algorithm generalises both the discrete Fourier transform and the Games-Chan algorithm 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.
  • The uniqueness of the Best code

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

    Proves that the (10,40,4) code found by Best (1980) is unique. The authors then employ this fact to show that A(10,3)=A(11,4)⩽78 and A(11,3)=A(12,4)⩽156 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.
  • 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.
  • A lower bound on the expected length of one-to-one codes

    Publication Year: 1994, Page(s):1670 - 1672
    Cited by:  Papers (33)  |  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.
  • 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 the number of digital convex polygons inscribed into an (m,m)-grid

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

    Binary images of objects are digitized by coloring a pixel cell black if more than half of its area is within the interior of the object. For simplicity, the digitization is often modified by looking only at the center point of a cell to determine its pixel value. The digitized boundary curve consists of a sequence of 4-directional links, sometimes called a "crack" code since it follows the cracks... 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.
  • 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.
  • The rate-distortion dimension of sets and measures

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

    Publication Year: 1994, Page(s):1667 - 1668
    Cited by:  Papers (8)
    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.
  • Data fusion with minimal communication

    Publication Year: 1994, Page(s):1551 - 1563
    Cited by:  Papers (29)
    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.
  • 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.

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