Scheduled System Maintenance
On Tuesday, September 25, IEEE Xplore will undergo scheduled maintenance from 1:00–5:00 pm ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Volume 40 Issue 3 • May 1994

Filter Results

Displaying Results 1 - 25 of 40
  • Catastrophic continuous phase modulation schemes and their noncatastrophic equivalents

    Publication Year: 1994, Page(s):687 - 695
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    Continuous phase modulation (CPM) schemes are bandwidth and energy efficient constant-envelope modulation schemes that can be viewed as a continuous-phase encoder (CPE) followed by a memoryless modulator (MM), where the CPE is of convolutional type. It is observed that CPM schemes can be catastrophic in the sense that pairs of input sequences that differ in an infinite number of positions can be m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The strong law of large numbers for sequential decisions under uncertainty

    Publication Year: 1994, Page(s):609 - 633
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2758 KB)

    Combines optimization and ergodic theory to characterize the optimum long-run average performance that can be asymptotically attained by nonanticipating sequential decisions. Let {X/sub t/} be a stationary ergodic process, and suppose an action b/sub t/ must be selected in a space /spl Bscr/ with knowledge of the t-past (X/sub 0/, /spl middot//spl middot//spl middot/, X/sub t-1/) at the beginning ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel simulation and coding with side information

    Publication Year: 1994, Page(s):634 - 646
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1076 KB)

    Studies the minimum random bit rate required to simulate a random system (channel), where the simulator operates with a given external input. As measures of simulation accuracy the authors use both the variational distance and the d~ distance between joint input-output distributions. They find the asymptotic number of random bits per input sample required for accurate simulation, as a function of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Very noisy channels, reliability functions, and exponentially optimum codes

    Publication Year: 1994, Page(s):647 - 661
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1102 KB)

    A very noisy channel (VNC), is a discrete-input memoryless channel whose capacity is close to zero. Very noisy channels are of interest, since they serve as models for some important physical channels. There are two distinct classes of VNCs: Reiffen's class I (Reiffen, 1963) and Majani's class II (Majani, 1987). It is shown that the reliability function is known exactly for both classes of VNCs, b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limitations of the capacity of the M-user binary adder channel due to physical considerations

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

    The capacity of the M-user binary adder channel, subjected to various restrictions of physical nature, is investigated. The underlying propagation media considered are (i) fiber-optic, with lossless coupling and Poisson statistics, (ii) radio, under Rayleigh fading, and (iii) radio with constant amplitudes and random phases. Whereas the capacity of the unrestricted (ideal) model for the binary add... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multiuser write-efficient memories

    Publication Year: 1994, Page(s):674 - 686
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1174 KB)

    Continuing earlier work (Ahlswede and Zhang, 1989) on write-efficient memories (WEM), the authors introduce new models, where several persons use the same storage device. At any time instant, exactly one of a prescribed set of users has access to the memory, but there is no protocol which determines the moving order. Among the constraints analyzed, the most interesting one is a complete privacy pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A paradigm for class identification problems

    Publication Year: 1994, Page(s):696 - 705
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1153 KB)

    The following problem arises in many applications involving classification, identification, and inference. There is a set of objects X, and a particular x /spl isin/ X is chosen (unknown to us). Based on information obtained about x in a sequential manner, one wishes to decide whether x belongs to one class of objects A/sub 0/ or a different class of objects A/sub 1/. The authors study a general p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressing inconsistent data

    Publication Year: 1994, Page(s):706 - 715
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1075 KB)

    In a frequent practical situation one possesses inconsistent fragmentary data concerning some industrial process or natural phenomenon. It is an interesting and reasonable task to assess what the most concise way to store or transmit them would be. The authors consider the zero-error case of the problem, i.e., we would like to save all the data incorporating them into the most concise but necessar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating binary sequences for stochastic computing

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

    The paper describes techniques for constructing statistically independent binary sequences with prescribed ratios of zeros and ones. The first construction is a general recursive construction, which forms the sequences from a class of "elementary" sequences. The second construction is a special construction which can be used when the ratio of ones to zeros is expressed in binary notation. The seco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The strong simplex conjecture is false

    Publication Year: 1994, Page(s):721 - 731
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (838 KB)

    The design of M average-energy-constrained signals in additive white Gaussian noise is addressed. The long-standing strong simplex conjecture, which postulates that the regular simplex signal set maximizes the probability of correct detection under an average-energy constraint, is disproven. A signal set is presented that performs better than the regular simplex signal set at low signal-to-noise r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimum complete orthonormal basis for signal analysis and design

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

    Derives a new set of basis functions which have high energy concentration in both time and frequency. The approach is based on transforming a signal energy maximization problem into an equivalent eigenvalue problem for a certain integral operator, and then showing that the eigenvectors of this integral operator form a complete orthonormal basis. This basis set is in some sense optimal since each b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfect maps

    Publication Year: 1994, Page(s):743 - 753
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1122 KB)

    Given positive integers r, s, u, and /spl upsi/, an (r, s; u, /spl upsi/) perfect map (PM) is defined to be a periodic r/spl times/s binary array in which every u/spl times//spl upsi/ binary array appears exactly once as a periodic subarray. Perfect maps are the natural extension of the de Bruijn sequences to two dimensions. In the paper the existence question for perfect maps is settled by giving... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfect binary codes: constructions, properties, and enumeration

    Publication Year: 1994, Page(s):754 - 763
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    Properties of nonlinear perfect binary codes are investigated and several new constructions of perfect codes are derived from these properties. An upper bound on the cardinality of the intersection of two perfect codes of length n is presented, and perfect codes whose intersection attains the upper bound are constructed for all n. As an immediate consequence of the proof of the upper bound the aut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Soft trellis-based decoder for linear block codes

    Publication Year: 1994, Page(s):764 - 773
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1019 KB)

    A systematic design of a trellis-based maximum-likelihood soft-decision decoder for linear block codes is presented. The essence of the decoder is to apply an efficient search algorithm for the error pattern on a reduced trellis representation of a certain coset. Rather than other efficient decoding algorithms, the proposed decoder is systematically designed for long codes, as well as for short co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to constructing optimal block codes for runlength-limited channels

    Publication Year: 1994, Page(s):774 - 785
    Cited by:  Papers (20)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1238 KB)

    The paper describes a technique for constructing fixed-length block codes for (d, k)-constrained channels. The codes described are of the simplest variety-codes for which the encoder restricted to any particular channel state is a one-to-one mapping and which is not permitted to "look ahead" to future messages. Such codes can be decoded with no memory and no anticipation and are thus an example of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universally ideal secret-sharing schemes

    Publication Year: 1994, Page(s):786 - 794
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (967 KB)

    Given a set of parties {1, /spl middot//spl middot//spl middot/, n}, an access structure is a monotone collection of subsets of the parties. For a certain domain of secrets, a secret-sharing scheme for an access structure is a method for a dealer to distribute shares to the parties. These shares enable subsets in the access structure to reconstruct the secret, while subsets not in the access struc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal detection games with power constraints

    Publication Year: 1994, Page(s):795 - 807
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1226 KB)

    Formulates and solves maximin and minimax detection problems for signals with power constraints. These problems arise whenever it is necessary to distinguish between a genuine signal and a spurious one designed by an adversary with the principal goal of deceiving the detector. The spurious (or deceptive) signal is subject to certain constraints, such as limited power, which preclude it from replic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration of complementary detection-localization systems-an example

    Publication Year: 1994, Page(s):808 - 819
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    The integration (or fusion) of two or more detection-localization systems often results in performance improvement, especially if they are complementary to each other. On the other hand, the cost of integration in additional signal processing and overhead may be considerable. As a figure of merit for this tradeoff, the authors propose the dB-gain-to-cost ratio and illustrate its evaluation by usin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the finite sample performance of the nearest neighbor classifier

    Publication Year: 1994, Page(s):820 - 837
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1445 KB)

    The finite sample performance of a nearest neighbor classifier is analyzed for a two-class pattern recognition problem. An exact integral expression is derived for the m-sample risk R/sub m/ given that a reference m-sample of labeled points is available to the classifier. The statistical setup assumes that the pattern classes arise in nature with fixed a priori probabilities and that points repres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nondirect convergence radius and number of iterations of the Hopfield associative memory

    Publication Year: 1994, Page(s):838 - 847
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1014 KB)

    Considers a Hopfield associative memory consisting of n neurons, designed to store an m-set of n-dimensional /spl plusmn/1 statistically independent uniformly distributed random vectors (fundamental memories), using a connection matrix, constructed by the usual Hebbian rule. Previous results have indicated that the maximal value of m, such that almost all m vectors are stable points of the memory,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Granular quantization noise in a class of delta-sigma modulators

    Publication Year: 1994, Page(s):848 - 859
    Cited by:  Papers (41)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1029 KB)

    The trend toward digital signal processing in communication systems has resulted in a large demand for fast accurate analog-to-digital (A/D) converters, and advances in VLSI technology have made /spl Delta//spl Sigma/ modulator-based A/D converters attractive solutions. However, rigorous theoretical analyses have only been performed for the simplest /spl Delta//spl Sigma/ modulator architectures. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trellis-based scalar-vector quantizer for memoryless sources

    Publication Year: 1994, Page(s):860 - 870
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1205 KB)

    The paper describes a structured vector quantization approach for stationary memoryless sources that combines the scalar-vector quantizer (SVQ) ideas (Laroia and Farvardin, 1993) with trellis coded quantization (Marcellin and Fischer, 1990). The resulting quantizer is called the trellis-based scalar-vector quantizer (TB-SVQ). The SVQ structure allows the TB-SVQ to realize a large boundary gain whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correctness within a constant of an optimal buffer allocation rule of thumb

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

    The problem is to allocate a fixed number of buffers among the nodes of an open network of exponential servers with Bernoulli routing and Poisson arrivals so as to optimize some performance criterion associated with the time to buffer overflow, such as maximizing its mean or maximizing the probability that it exceeds some value. In earlier work, the authors used pathwise probabilistic arguments to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A metric entropy bound is not sufficient for learnability

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

    The authors prove by means of a counterexample that it is not sufficient, for probably approximately correct (PAC) learning under a class of distributions, to have a uniform bound on the metric entropy of the class of concepts to be learned. This settles a conjecture of Benedek and Itai (1991).<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non white Gaussian multiple access channels with feedback

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

    Although feedback does not increase the capacity of an additive white noise Gaussian channel, it enables prediction of the noise for non-white additive Gaussian noise channels and results in an improvement of capacity, but at most by a factor of 2 (Pinsker, Ebert, Pombra, and Cover). Although the capacity of white noise channels cannot be increased by feedback, multiple access white noise channels... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu