IEEE Transactions on Information Theory

Issue 2 • March 1995

Filter Results

Displaying Results 1 - 25 of 38
  • On a technique to calculate the exact performance of a convolutional code

    Publication Year: 1995, Page(s):441 - 447
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (732 KB)

    A Markovian technique is described to calculate the exact performance of the Viterbi algorithm used as either a channel decoder or a source encoder for a convolutional code. The probability of information bit error and the expected Hamming distortion are computed for codes of various rates and constraint lengths. The concept of tie-breaking rules is introduced and its influence on decoder performa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error bounds for parallel distributed detection under the Neyman-Pearson criterion

    Publication Year: 1995, Page(s):528 - 533
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (412 KB)

    The Neyman-Pearson performance of a distributed detection system is considered wherein n independent and identically distributed observations are quantized locally into M-ary messages and transmitted to a fusion center. Under fairly general assumptions, it is shown that the type II error probability achieved by the best identical-quantizer system is at most a fixed (in n) multiple of that achieved... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the trellis complexity of certain binary linear block codes

    Publication Year: 1995, Page(s):559 - 560
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (196 KB)

    The trellis complexity s(C) of an [n, k, d]-code C is investigated, in the case where the weights of nonzero codewords in C are confined to {d, ···, 2d-1}∪{n}. It is shown that s(C)⩾k-1. Furthermore, s(C)=k-1 if the code is self-complementary. If the nonzero weights are confined to {d, ···, 2d-3}, then s(C)=k View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The automorphism groups of the generalized quadratic residue codes

    Publication Year: 1995, Page(s):378 - 386
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (632 KB)

    We give the full automorphism groups as groups of semiaffine transformations, of the extended generalized quadratic residue codes. We also present a proof of the Gleason-Prange theorem for the extended generalized quadratic residue codes that relies only on their definition and elementary theory of linear characters View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotic relative efficiency of distributed detection schemes

    Publication Year: 1995, Page(s):523 - 527
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (388 KB)

    The asymptotic relative efficiency (ARE) of two centralized detection schemes has proved useful in large-sample-size and weak-signal performance analysis. In the present paper ARE is applied to some distributed detection cases which use counting fusion rules. In such cases one finds that ARE generally depends on the power of the tests which can make its application difficult. This dependence turns... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence analysis of the sign algorithm for adaptive filtering

    Publication Year: 1995, Page(s):489 - 495
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (428 KB)

    We consider the convergence analysis of the sign algorithm for adaptive filtering when the input processes are uncorrelated and Gaussian and a fixed step size μ>0 is used. Exact recursive equations for the covariance matrix of the deviation error are established for any step size μ>0. Asymptotic time-averaged convergence for the mean-absolute deviation error, mean-square deviation erro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically good codes have infinite trellis complexity

    Publication Year: 1995, Page(s):555 - 559
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (476 KB)

    The trellis complexity s(C) of a block code C is defined as the logarithm of the maximum number of states in the minimal trellis realization of the code. The parameter s(C) governs the complexity of maximum-likelihood decoding, and is considered a fundamental descriptive characteristic of the code in a number of recent works. We derive a new lower bound on s(C) which implies that asymptotically go... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quaternary quadratic residue codes and unimodular lattices

    Publication Year: 1995, Page(s):366 - 377
    Cited by:  Papers (80)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (980 KB)

    We construct new self-dual and isodual codes over the integers module 4. The binary images of these codes under the Gray map are nonlinear, but formally self-dual. The construction involves Hensel lifting of binary cyclic codes. Quaternary quadratic residue codes are obtained by Hensel lifting of the classical binary quadratic residue codes. Repeated Hensel lifting produces a universal code define... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding with digits of unequal cost

    Publication Year: 1995, Page(s):596 - 600
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (448 KB)

    At present, optimal coding for a noiseless digital channel with digits of unequal cost requires solving a large linear programming problem. Much simpler procedures give codes, resembling Shannon's (1948) and Huffman's, that are found close to optimal in tests with typical sources and channels View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback does not increase the capacity of discrete channels with additive noise

    Publication Year: 1995, Page(s):546 - 549
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (332 KB)

    We consider discrete-time finite alphabet channels with additive random noise. We show that output feedback does not increase the capacity of such channels. This result holds in the most general case; i.e., for arbitrary additive noise processes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm

    Publication Year: 1995, Page(s):478 - 488
    Cited by:  Papers (29)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (836 KB)

    Consider the parsing algorithm developed by Lempel and Ziv (1978) that partitions a sequence of length n into variable phrases (blocks) such that a new block is the shortest substring not seen in the past as a phrase. In practice, the following parameters are of interest: number of phrases, the size of a phrase, the number of phrases of given size, and so forth. In this paper, we focus on the size... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subclass of binary Goppa codes with minimal distance equal to the design distance

    Publication Year: 1995, Page(s):554 - 555
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (168 KB)

    A subclass of binary Goppa codes specified by a separable polynomial G(x)=xt+A and a subset L of elements of GF(2m ) (no element of L may be a root of G(x) and t|(2m-1), A is a tth power in {GF(2m)/{0}}, is studied. For such codes it is shown that their minimal distance is equal to the design distance d=2t+1 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling nonuniform traffic in a packet switching system with large propagation delay

    Publication Year: 1995, Page(s):358 - 365
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (756 KB)

    Transmission algorithms are introduced for use in a single-hop packet switching system with nonuniform traffic and with propagation delay that Is large relative to the packet transmission time. The traffic model allows arbitrary traffic streams subject only to a constraint on the number of data packets which can arrive at any individual source in the system or for any individual destination in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel diversity coding with distortion

    Publication Year: 1995, Page(s):412 - 422
    Cited by:  Papers (77)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (704 KB)

    In a Diversity Coding System, an information source is encoded by a number of encoders. There are a number of decoders, each of which can access a certain subset of the encoders. We study a diversity coding problem in which there are two levels of decoders. The reconstructions of the source by decoders within the same level are identical, and are subject to the same distortion criterion. Our resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded minimum distance decoding of unit memory codes

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

    We propose an algorithm for bounded minimum distance decoding of (partial) unit memory codes up to half the “designed” extended row distance. It makes use of a reduced trellis with the nodes found by bounded minimum distance decoding of the block codes used in the unit memory code. The results can be extended to general multimemory codes. The complexity of this algorithm is upper bound... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source correlation in a K-out-of-M multiple-access channel

    Publication Year: 1995, Page(s):540 - 546
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (528 KB)

    A K-out-of-M multiple-access channel is a mathematical model for transmission of information between a large number of potential transmitters and one receiver, where at any transmission interval only a (usually small) number of transmitters are actively transmitting their messages. We study the problem of matching between correlated information sources and a K-out-of-M multiple-access channel. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed cell-averaging CFAR detection in dependent sensors

    Publication Year: 1995, Page(s):513 - 518
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (456 KB)

    Constant false alarm rate detection is considered in a decentralized, two-sensor context. Cases with observations which are dependent from sensor to sensor are investigated, for which results have been lacking. The in-phase and quadrature components of the received narrowband observation at each sensor consist of a common weak random signal in additive Gaussian combined clutter and noise. The sens... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The threshold probability of a code

    Publication Year: 1995, Page(s):469 - 477
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (672 KB)

    We define and estimate the threshold probability θ of a linear code, using a theorem of Margulis (1974) originally conceived for the study of the probability of disconnecting a graph. We then apply this concept to the study of the erasure and Z-channels, for which we propose linear coding schemes that admit simple decoding. We show that θ is particularly relevant to the erasure channel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Min-max signal design for detection subject to linear distortion

    Publication Year: 1995, Page(s):533 - 536
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (308 KB)

    Considers the problem of deciding between M signals that are observed through an unknown FIR system (channel). The authors suggest a generalized likelihood ratio test, and develop an upper bound on the detection performance under the worst possible channel. They then suggest a signal design strategy that is immune to the unknown channel effect in which they construct the transmitted signals using ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance spectra and upper bounds on error probability for trellis codes

    Publication Year: 1995, Page(s):561 - 572
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (684 KB)

    The problem of estimating error probability for trellis codes is considered. The set of all squared Euclidean distances between code sequences is presented as a countable set. This representation is used for calculating the generating functions for upper-bounding error probability and bit error probability for trellis codes satisfying some symmetry conditions. The generating functions of squared E... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The q-ary image of a qm-ary cyclic code

    Publication Year: 1995, Page(s):387 - 399
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (884 KB)

    For (n, q)=1 V a qm-ary cyclic code of length n and with generator polynomial g(x), we show that there exists a basis for F(qm) over Fq with respect to which the q-ary image of V is cyclic, if and only if: (i) g(x) is over Fq; or (ii) g(x)=g0(x)(x-γ-q(μ)), g0(x) is over Fq, Fq≠F(qk View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference suppression by biased nonlinearities

    Publication Year: 1995, Page(s):496 - 507
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (792 KB)

    It is shown that, when the input signal-to-interference ratio (SIR) is small, a biased nonlinearity that has a dead zone below some threshold value can provide a large enhancement in output SIR and signal-to-interference-plus-intermodulation ratio (SIIMR) if the threshold is set equal or close to the amplitude of the strong interference. In the absence of noise, the output SIR and SIIMIR are virtu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New bounds on the information rate of secret sharing schemes

    Publication Year: 1995, Page(s):549 - 554
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (568 KB)

    ´A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. We derive new limitations on the information rate of secret sharing schemes, that measures how much information is being distributed as shares as compared to the siz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple description source coding with no excess marginal rate

    Publication Year: 1995, Page(s):349 - 357
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (492 KB)

    Multiple description source coding concerns situations in which the transmission of the source information is distributed over two data streams at rates R1 and R2, respectively. When both data streams are received, the decoder uses the combined data at rate R1+R2 to reconstruct the source information with average distortion d0. If a communicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • d-form sequences: families of sequences with low correlation values and large linear spans

    Publication Year: 1995, Page(s):423 - 431
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (684 KB)

    Large families of binary sequences with low correlation values and large linear span are critical for spread-spectrum communication systems. The author describes a method for constructing such families from families of homogeneous functions over finite fields, satisfying certain properties. He then uses this general method to construct specific families of sequences with optimal correlations and e... 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