By Topic

IEEE Transactions on Information Theory

Issue 3 • May 1994

Filter Results

Displaying Results 1 - 25 of 40
  • The strong simplex conjecture is false

    Publication Year: 1994, Page(s):721 - 731
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 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.
  • Norm quadratic-residue codes

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

    Introduces a new class of binary linear error-correcting codes, based on the concept of the finite upper half-plane. A norm quadratic-residue code Cp has p(p-1) coordinate places labeled by ordered pairs (a,b), where p is a prime of the form 4m+1 and a,b ∈ GF(p), b≠0. Some fundamental properties of Cp are established View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal shaping properties of the truncated polydisc

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

    Multidimensional constellation shaping with a family of regions called truncated polydiscs is studied. This family achieves maximum shaping gain for a given two-dimensional peak-to-average energy ratio or a given two-dimensional constellation expansion ratio. An efficient algorithm for mapping data words to constellation points is described that requires O(N log N) arithmetic operations and O(N 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 (984 KB)

    The following problem arises in many applications involving classification, identification, and inference. There is a set of objects X, and a particular x ∈ 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 A0 or a different class of objects A1. The authors study a gen... 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 (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 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 Rm 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 r... 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 (1048 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 a... 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 (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 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 notati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for delay-insensitive communication with partial synchronization

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

    Assume that information is transmitted in parallel among many lines in such a way that an electrical transition represents a 1 and an absence of a transition represents a 0. The propagation delay in the wires varies and results in asynchronous reception. The challenge is to find an efficient communication scheme that will be delay-insensitive. One of the common solutions to this problem is to use ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructive codes for arbitrary discrete memoryless channels

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

    In 1982, Delsarte and Piret constructed a concatenated code for which the error probability decreases exponentially with the block length for a subclass of symmetric channels called regular channels. In the case of arbitrary discrete memoryless channels, they were not able to prove an exponential bound, but one for which the error probability decreases as (log N/N)α where α ... 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 (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 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.
  • 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 (992 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.
  • On the weight hierarchy of geometric Goppa codes

    Publication Year: 1994, Page(s):913 - 920
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The weight hierarchy of a linear code is the set of generalized Hamming weights of the code. In the paper, the authors consider geometric Goppa codes and provide a lower bound on their generalized Hamming weights similar to Goppa's lower bound on their minimum distance. In the particular case of Hermitian codes, exact results on the second and third generalized Hamming weights are given for any m ... 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 (884 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.
  • Soft trellis-based decoder for linear block codes

    Publication Year: 1994, Page(s):764 - 773
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 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.
  • Correctness within a constant of an optimal buffer allocation rule of thumb

    Publication Year: 1994, Page(s):871 - 882
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 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.
  • 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 (924 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.
  • Reduced-state sequence detection with convolutional codes

    Publication Year: 1994, Page(s):965 - 972
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    Reduced-state sequence detection (RSSD) reduces the state trellis of a channel code by forming the states into classes. States within a class are such that paths into the states lie further than a distance parameter d from each other. An RSSD decoder retains only one survivor per class at each trellis level. The authors apply RSSD to ordinary binary convolutional codes. They first give a class-for... 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 (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 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.
  • Three best binary linear block codes of minimum distance fifteen

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

    Three new best codes, [37, 9, 15], [42, 12, 15], and [48, 16, 15], their weight distributions, and a brief description of the used search algorithms are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techniques of bounding the probability of decoding error for block coded modulation structures

    Publication Year: 1994, Page(s):903 - 911
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    Two techniques for upper bounding the average probability of decoding error in coded modulation structures are presented. The first bound, which is applicable to the additive white Gaussian noise (AWGN) channel, is tighter than the well-known union bound and the minimum distance bound, especially for low signal to noise ratio. It is shown that for the Leech lattice this upper bound is very close t... 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 (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 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.
  • Nondirect convergence radius and number of iterations of the Hopfield associative memory

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

    Considers a Hopfield associative memory consisting of n neurons, designed to store an m-set of n-dimensional ±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, in ... 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 (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    Given a set of parties {1, ···, 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 structure get no ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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 (664 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.
  • On the principal state method for run-length limited sequences

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

    Presents a detailed result on Franaszek's (1968) principal state method for the generation of run-length constrained codes. The authors show that, whenever the constraints k and d satisfy k⩾2d>0, the set of “principal states” is s0, s1, ···, sk-1. Thus there is no need for Franaszek's search algorithm anymore. The counting te... 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