By Topic

IEEE Transactions on Information Theory

Issue 3 • May 1994

Filter Results

Displaying Results 1 - 25 of 40
  • 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 (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.
  • 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 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 strong simplex conjecture is false

    Publication Year: 1994, Page(s):721 - 731
    Cited by:  Papers (16)
    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.
  • A class of constacyclic codes

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

    A class of qm-ary constacyclic codes is defined which has the property that the q-ary image is equivalent to a class of shortened cyclic codes. This description leads to the construction of nonlinear codes. As an example one can construct nonlinear codes of length N=qm+1 over the field GF(qm'), m'⩽m, with a minimum distance greater than N(1-R)m'/m, where R is t... 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.
  • 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.
  • 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 (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.
  • Universally ideal secret-sharing schemes

    Publication Year: 1994, Page(s):786 - 794
    Cited by:  Papers (40)
    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.
  • 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.
  • 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.
  • 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 (1044 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 (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.
  • An optimum complete orthonormal basis for signal analysis and design

    Publication Year: 1994, Page(s):732 - 742
    Cited by:  Papers (4)
    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.
  • 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 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.
  • 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.

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