By Topic

IEEE Transactions on Information Theory

Issue 5 • Date 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 (10)
    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 (5)
    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.
  • 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.
  • Bounds on the probability of deception in multiple authentication

    Publication Year: 1994, Page(s):1586 - 1591
    Cited by:  Papers (7)
    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.
  • Number of nearest neighbors in a Euclidean code

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

    A Euclidean code is a finite set of points in n-dimensional Euclidean space ℛn. The total number of nearest neighbors of a given codepoint in the code is called its touching number. We show that the maximum number of codepoints Fn that can share the same nearest-neighbor codepoint is equal to the maximum kissing number τn in n dimensions, that is, the maxi... 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 (1)
    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.
  • Decoding of convolutional codes using a syndrome trellis

    Publication Year: 1994, Page(s):1663 - 1666
    Cited by:  Papers (31)  |  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.
  • Dynamic system identification with order statistics

    Publication Year: 1994, Page(s):1474 - 1489
    Cited by:  Papers (19)
    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.
  • On the efficiency of on-line density estimators

    Publication Year: 1994, Page(s):1504 - 1512
    Cited by:  Papers (3)
    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.
  • 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.
  • 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 (18)
    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.
  • Symmetry properties of multilevel coded modulation

    Publication Year: 1994, Page(s):1630 - 1632
    Cited by:  Papers (3)
    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.
  • 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.
  • 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 (8)
    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.
  • 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.
  • 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 (28)  |  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.
  • 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.
  • 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.
  • 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.
  • Joint transmitter-receiver optimization for multi-input multi-output systems with decision feedback

    Publication Year: 1994, Page(s):1334 - 1347
    Cited by:  Papers (82)  |  Patents (28)
    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.
  • 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.
  • 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.
  • 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.
  • Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not

    Publication Year: 1994, Page(s):1425 - 1442
    Cited by:  Papers (7)
    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.

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