IEEE Transactions on Information Theory

Issue 3 • May 1994

Filter Results

Displaying Results 1 - 25 of 40
  • The strong law of large numbers for sequential decisions under uncertainty

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

    Combines optimization and ergodic theory to characterize the optimum long-run average performance that can be asymptotically attained by nonanticipating sequential decisions. Let {Xt} be a stationary ergodic process, and suppose an action bt must be selected in a space ℬ with knowledge of the t-past (X0, ···, Xt-1) at the beginn... 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.
  • 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.
  • 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.
  • 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.
  • Polynomial estimation of the amplitude of a signal

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

    The problem of estimating the amplitude of a signal is addressed using higher-order statistics. The probability distribution of the noise is assumed to be unknown so that the maximum likelihood estimator cannot be calculated. The estimator is taken as a polynomial of the observation, the coefficients of which are determined so that the estimate is unbiased with minimum variance. This method genera... 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 (19)
    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.
  • 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.
  • On the weight hierarchy of geometric Goppa codes

    Publication Year: 1994, Page(s):913 - 920
    Cited by:  Papers (35)
    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.
  • A sharp false alarm upper-bound for a matched filter bank detector

    Publication Year: 1994, Page(s):955 - 960
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    A sharp upper bound on the probability of false alarm, PF , of a matched filter bank detector over the class of input variates that are zero mean and have a specified covariance matrix, R xx, is derived. This bound is a function of the detector threshold, T, and Rxx. It is shown that the bound is inversely proportional to T2. Hence there may be a wide va... 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 (65)
    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.
  • Generating binary sequences for stochastic computing

    Publication Year: 1994, Page(s):716 - 720
    Cited by:  Papers (21)
    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.
  • 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.
  • 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.
  • On the bounds on odd correlation of sequences

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

    A construction, similar to that of Sidelnikov (1971) and Welch (1974), is proposed to transform bounds on inner products into bounds on odd correlations of a set of sequences with equal energy. Contrary to Sarwate's (1979) result, the present authors show that bounds on odd cross-correlation and autocorrelation can easily be derived from Welch's more general bounds. Generally speaking, since all k... 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 (19)
    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.
  • 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.
  • 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.
  • 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.
  • Compressing inconsistent data

    Publication Year: 1994, Page(s):706 - 715
    Cited by:  Papers (17)
    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.
  • Channel simulation and coding with side information

    Publication Year: 1994, Page(s):634 - 646
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 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 functio... 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.
  • 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.
  • 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.

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