IEEE Transactions on Information Theory

Issue 3 • May 1994

Filter Results

Displaying Results 1 - 25 of 40
  • On the principal state method for run-length limited sequences

    Publication Year: 1994, Page(s):934 - 941
    Cited by:  Papers (3)
    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.
  • 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.
  • On the construction of Cartesian authentication codes over symplectic spaces

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

    Various constructions of authentication codes using spaces related to the general linear group have been proposed and analyzed. In the paper the authors describe two new constructions of Cartesian authentication codes using symplectic spaces. This illustrates the feasibility of codes from spaces based on geometries of the other classical groups 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 (1048 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.
  • On the weight hierarchy of geometric Goppa codes

    Publication Year: 1994, Page(s):913 - 920
    Cited by:  Papers (36)
    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.
  • Perfect maps

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

    Given positive integers r, s, u, and υ, an (r, s; u, υ) perfect map (PM) is defined to be a periodic r×s binary array in which every u×υ 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 constructions for p... 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 (43)
    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.
  • The weight distribution of cosets

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

    Sullivan's (1967) inequality between the weight distribution function of a binary linear code and the weight distribution function of a proper subset of the code is generalized to linear codes over arbitrary finite fields 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 (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.
  • 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 (276 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) 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 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.
  • 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.
  • 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.
  • 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.
  • Techniques of bounding the probability of decoding error for block coded modulation structures

    Publication Year: 1994, Page(s):903 - 911
    Cited by:  Papers (49)
    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.
  • The strong simplex conjecture is false

    Publication Year: 1994, Page(s):721 - 731
    Cited by:  Papers (17)
    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.
  • Correctness within a constant of an optimal buffer allocation rule of thumb

    Publication Year: 1994, Page(s):871 - 882
    Cited by:  Papers (6)
    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.
  • 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 (652 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.
  • Reduced-state sequence detection with convolutional codes

    Publication Year: 1994, Page(s):965 - 972
    Cited by:  Papers (29)  |  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.
  • Coding for delay-insensitive communication with partial synchronization

    Publication Year: 1994, Page(s):941 - 945
    Cited by:  Papers (5)
    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.
  • 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.
  • Perfect binary codes: constructions, properties, and enumeration

    Publication Year: 1994, Page(s):754 - 763
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (828 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.
  • 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.
  • 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.

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