Scheduled System Maintenance
On Tuesday, January 23, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Issue 5 • Sep 1991

Filter Results

Displaying Results 1 - 25 of 34
  • A new implementation of the Ziv-Lempel incremental parsing algorithm

    Publication Year: 1991, Page(s):1439 - 1440
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    Combining a note by J. Rissanen (1983) and an idea of enumerative coding, the authors obtain a new implementation of the Ziv-Lempel incremental parsing algorithm for coding and decoding discrete data sequences. The space and the time complexities are linear for both the encoder and the decoder. The authors describe the algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Hamming weights for linear codes

    Publication Year: 1991, Page(s):1412 - 1418
    Cited by:  Papers (293)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Motivated by cryptographical applications, the algebraic structure, of linear codes from a new perspective is studied. By viewing the minimum Hamming weight as a certain minimum property of one-dimensional subcodes, a generalized notion of higher-dimensional Hamming weights is obtained. These weights characterize the code performance on the wire-tap channel of type II. Basic properties of generali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of entropy-constrained block transform quantizers

    Publication Year: 1991, Page(s):1433 - 1439
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    An analysis of the rate-distortion performance of an entropy-constrained block transform quantization scheme operating on first-order stationary Gauss-Markov sources is presented. Uniform threshold quantization is employed to quantize the transform coefficients. An algorithm for optimum stepsize (or, equivalently, entropy) assignment among the quantizers is developed and a simple asymptotic formul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of signal sets for partial-response channels. II. Asymptotic coding gain

    Publication Year: 1991, Page(s):1342 - 1354
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    For Pt. I see ibid., vol.37, no.5, p.1327-141 (1991). For a linear, time-invariant, discrete-time channel with a given transfer function H(f), and information rate R bits/ T, where T is the symbol interval, an optimal signal set of length K is defined to be a set of 2RK inputs of length K that maximizes the minimum l View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gambling using a finite state machine

    Publication Year: 1991, Page(s):1459 - 1465
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Sequential gambling schemes in which the amount wagered on the future outcome is determined by a finite state (FS) machine are defined and analyzed. It is assumed that the FS machine determines the fraction of the capital wagered at each time instance i on the outcome at the next time instance, i+1, and that wagers are paid at even odds. The maximal capital achieved by any FS mac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the monotonic property of the probability of undetected error for a shortened code

    Publication Year: 1991, Page(s):1409 - 1411
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    The monotonic property of the probability of undetected error is considered when a shortened code of a linear code over GF(q) is used for error detection on a q-ary symmetric channel. Some conditions are presented under which the probability of undetected error is (or is not) monotonic with respect to the code length or the symbol error probability. It is shown that the probabili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the connectivity of radio networks

    Publication Year: 1991, Page(s):1490 - 1492
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    The connectivity of a two-dimensional radio network as a function of the range of the transmitters is still an open problem. It has bee conjectured that the critical range of this problem is the same as the one for the covering problem. The analysis of the one-dimensional problem makes it clear that situations can exist where these two ranges are different. It is conjectured that the critical rang... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new asymptotically optimal code for the positive integers

    Publication Year: 1991, Page(s):1420 - 1429
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    A new universal binary code for the positive integers is proposed as a modified version of M. Wang's (see ibid., vol.34, p.324-6, Mar. 1988) flag encoding scheme. The codeword length of the new scheme is shorter than Wang's, on an average, for large initial segments of the positive integers. The performance of the new scheme is also compared with that of other universal schemes. Furthermore, it is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal distance lexicographic codes over an infinite alphabet

    Publication Year: 1991, Page(s):1366 - 1368
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    The author investigates the properties of minimal distance lexicographic codes, or lexicode, over the ordered infinite alphabet N={0,1,2…}. The author presents a method for computing the basis of such a code. It is shown that any lexicographic code S with minimal distance d has a unique basis where each basis vector is a one followed by a string of zeros, followed by d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of digital tries with Markovian dependency

    Publication Year: 1991, Page(s):1470 - 1475
    Cited by:  Papers (29)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    A complete characterization of a digital tree, also called a trie, is presented from the depth viewpoint in a Markovian framework, that is, under the assumption that symbols in a key are Markov-dependent. The main findings show that asymptotically, as the number of keys n tends to infinity, the average depth becomes EDn~(1/ h1) log N+c<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A [55,16,19] binary Goppa code and related codes having large minimum distance

    Publication Year: 1991, Page(s):1432 - 1433
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    A [55,16,19] binary Goppa code is used to construct [57,17,17], [58,17,18], [59,17,19], and [60,17,20] codes. The first two codes have smaller redundancy than previously known codes (linear or nonlinear) of the same length and minimum distance. The last two codes have parameters previously attained only by nonlinear codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of signal sets for partial-response channels. I. Numerical techniques

    Publication Year: 1991, Page(s):1327 - 1341
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1376 KB)

    Given a linear, time-invariant, discrete-time channel, the problem of constructing N input signals of finite length K that maximize minimum l2 distance between pairs of outputs is considered. Two constraints on the input signals are considered: a power constraint on each of the N inputs (hard constraint) and an average power constraint over the entire set of i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the convergence of the minimum variance spectral estimator in nonstationary noise

    Publication Year: 1991, Page(s):1457 - 1459
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    A simple proof is presented of the convergence of the minimum variance spectral estimator to the point spectrum, as the order of the covariance matrix goes to infinity. This is done in the multichannel setting where the corrupting unknown noise process is allowed to be nonstationary. Explicit bounds are also obtained on the rate of convergence View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A strengthening of the Assmus-Mattson theorem

    Publication Year: 1991, Page(s):1261 - 1268
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Let w1=d,w2,…,w s be the weights of the nonzero codewords in a binary linear [n,k,d] code C, and let w' 1, w'2, …, w'3, be the nonzero weights in the dual code C1. Let t be an integer in the range 0<t<d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error and erasure control (d,k) block codes

    Publication Year: 1991, Page(s):1399 - 1408
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    New combinatorial and algebraic techniques are presented for systematically different (d,k) block codes capable of detecting and correcting single bit-errors, single-peak shift-errors, double adjacent-errors and multiple adjacent erasures. Constructions utilizing channel side information, such as the magnetic recording ternary channel output string, or erasures, do not impose any... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for the initial state reconstruction of the clock-controlled shift register

    Publication Year: 1991, Page(s):1488 - 1490
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    An algorithm is given for the reconstruction of the initial state of a key-stream generator (KSG) consisting of a short linear feedback shift register (length ⩽30), whose clock is controlled by an algebraically simple internal KSG. The algorithm is based on the fact that the expected number of possible binary linear feedback shift register initial states exponentially decreases with the length... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On codes satisfying Mth-order running digital sum constraints

    Publication Year: 1991, Page(s):1294 - 1313
    Cited by:  Papers (24)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1548 KB)

    Multi level sequences with a spectral null of order M at frequency f, meaning that the power spectral density, and its first 2M-1 derivatives vanish at f, are characterized by finite-state transition diagrams (FSTDs) whose edge labels satisfy bounds on the variation of the Mth-order running digital sum (RDS). Necessary and sufficient conditions for FSTDs with higher order null co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memoryless nonlinear system identification with unknown model order

    Publication Year: 1991, Page(s):1440 - 1450
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    The problem of identifying a general memoryless input/output system from measurements of inputs and the corresponding outputs is considered. The measured output is sought to be represented as the linear combination of known functions of the input with some additive noise. The choice of model order to be used to fit the data is the main issue addressed, and a cost function involving the prediction ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear unequal error-protection codes are sometimes better than linear ones

    Publication Year: 1991, Page(s):1418 - 1420
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    The parameters of some binary nonlinear two-level unequal error-protection (UEP) codes are evaluated and compared with nonexistence bounds for linear UEP codes. The major points is that for UEP codes linearity is an essential restriction. The results demonstrate that at least in certain cases nonlinear codes perform better than linear ones. This is in contrast to the situation for ordinary codes, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A vector quantizer for the Laplace source

    Publication Year: 1991, Page(s):1355 - 1365
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    The low complexity, nearly optimal vector quantizer (VQ) is a generalization of T. R. Fischer's (1986) pyramid VQ and is similar in structure to the unrestricted polar quantizers previously presented for the independent Gaussian source. An analysis of performance is presented with results for both the product code pyramid VQ and the unrestricted version. This analysis, although asymptotic in natur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating distortion in a binary symmetric channel consistently

    Publication Year: 1991, Page(s):1466 - 1470
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    The problem of estimating the distortion in a binary symmetric channel is examined. A consistent estimator is described, and its performance is assessed numerically. The estimator is based solely on the information contained in the channel output. The channel input is viewed as an unobservable nuisance parameter that satisfies a weak basic assumption that (1) makes the problem of estimation viable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of some binary linear codes of minimum distance five

    Publication Year: 1991, Page(s):1429 - 1432
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    A method of constructing binary linear codes that have a minimum Hamming distance of five is presented. The author proposes a general formulation of the parity check matrix for the desired code and then derives necessary conditions for the code to have a minimum distance of five. Some new codes that satisfy the necessary conditions are described. Some efficient new codes are obtained. In particula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Innovations informational equivalence for a class of observations with independent non-Gaussian noise

    Publication Year: 1991, Page(s):1369 - 1378
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    The problem of innovations informational equivalence for observations with non-Gaussian additive noise is addressed. It is assumed that the additive noise is a non-Gaussian continuous martingale with an almost surely absolutely continuous quadratic covariation process. Under the assumptions of stochastic independence between the signal and the noise and of square integrability conditions on them, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for the generation of DeBruijn cycles

    Publication Year: 1991, Page(s):1475 - 1478
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    An algorithm is presented for the generation of binary DeBruijn sequences using feedback shift registers (FSRs). The algorithm is based on the principle of cycle joining, through which all the cycles in the cycle structure of a FSR can be joined together to one complete cycle, thereby producing a DeBruijn sequence of period 2n, where n is the length of the FSR. By a proper choi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Gleason-Prange theorem

    Publication Year: 1991, Page(s):1269 - 1273
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    The Gleason-Prange theorem describes a nontrivial automorphism of an extended quadratic residue code. By using the Fourier transform in an appropriate extension field, methods of digital signal processing are used to make the proof transparent and the automorphism intuitive. The theorem is proved both in a field of characteristic tow and in an arbitrary field and is stated simply as a general prop... 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