Proceedings of 1995 IEEE International Symposium on Information Theory

17-22 Sept. 1995

Filter Results

Displaying Results 1 - 25 of 502
  • Proceedings of 1995 IEEE International Symposium on Information Theory

    Publication Year: 1995
    Request permission for commercial reuse | |PDF file iconPDF (1345 KB)
    Freely Available from IEEE
  • Wavelets: an overview, with recent applications

    Publication Year: 1995
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (27 KB)

    Summary form only given. Wavelets have emerged in the last decade as a synthesis from many disciplines, ranging from pure mathematics (where forerunners were used to study singular integral operators) to electrical engineering (quadrature mirror filters), borrowing in passing from quantum physics, from geophysics and from computer aided design. The author presents an overview of the ideas in wavel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotics of Fisher information under weak perturbation

    Publication Year: 1995
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (111 KB)

    An asymptotic expression is derived for the Fisher information of the sum of two independent random variables X and Z/sub /spl epsiv// when Z/sub /spl epsiv// is small, under some regularity conditions on the density of X and conditions on the moments of Z/sub /spl epsiv//. Using this result for the case Z/sub /spl epsiv//=/spl epsiv/Z, some asymptotic generalization of De Bruijn's identity is obt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The trellis structure of maximal fixed-cost codes

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (131 KB)

    We show that the family of maximal fixed-cost codes, with codeword costs defined in a right-cancellative semigroup, have biproper trellis presentations. Examples of maximal fixed-cost codes include such "nonlinear" codes as permutation codes, shells of constant Euclidean norm in the integer lattice, and of course ordinary linear codes over a finite field. The intersection of two codes having bipro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-number DFT codes on a fading channel

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (104 KB)

    The utilization of real-number DFT codes for a multiplicative channel is introduced. By the proposed encoding procedure, some redundancies can be added into the transmitted data. With these redundancies, syndromes for the parameters of a fading channel can be obtained from the received data. The decoding algorithm for real-number DFT codes can be used to calculate the fading parameters with these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cascaded convolutional codes

    Publication Year: 1995
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (107 KB)

    The construction and performance of cascaded convolutional codes is investigated. An interleaver is used between the inner and outer codes to redistribute errors out of the inner decoder. In addition, the structure of the interleaver is exploited to improve the distance properties of the overall cascaded code. This configuration is shown to have a performance advantage compared to a single complex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of trellis codes at high spectral efficiencies for use with sequential decoding

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (130 KB)

    Sequential decoding of trellis codes at high spectral efficiencies is investigated and large constraint length trellis codes for two dimensional and four dimensional constellations are constructed for use with sequential decoding. It is shown that the channel cut-off rate bound can be achieved using constraint lengths between 16 and 19 with sequential decoding at a bit error rate of 10/sup -5/-10/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The generalized Hamming weight of some BCH codes and related codes

    Publication Year: 1995
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (119 KB)

    We determine the generalized Hamming weights d/sub r/ for 1/spl les/r/spl les/h+2 of a binary primitive BCH code with minimum distance d=2/sup h/-1. This extends a result of van der Geer and van der Vlugt (see IEEE Trans. on Inform. Theory, vol.40, p. 543-46, 1994 and vol. 41, p.300-1, 1995) who determined d/sub r/, for 1/spl les/r/spl les/5 for the triple error correcting primitive BCH code. We a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A recursive formulation for quadratic detection on Rayleigh fading channels

    Publication Year: 1995
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (130 KB)

    We address the problem of optimal detection of a random signal transmitted over a time-varying frequency-selective correlated Rayleigh fading channel. We present a general recursive solution which may be operated at full complexity to provide optimal detection or at reduced complexity, using per-survivor processing (PSP) techniques, to yield a suboptimal receiver. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring time-frequency information and complexity using the Renyi entropies

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (128 KB)

    In search of a nonparametric indicator of deterministic signal complexity, we link the Renyi entropies to time-frequency representations. The resulting measures show promise in several situations where concepts like the time-bandwidth product fail. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On interval linear complexity of binary sequences

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (124 KB)

    We consider the problem of partial approximation of binary sequences by the outputs of linear feedback shift registers. A generalization of the linear complexity profiles of binary sequences leads to a sequence that is regarded as the profile of interval linear complexity. Some properties of this sequence are examined. View full abstract»

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

    Publication Year: 1995
    Request permission for commercial reuse | |PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • First order approximation of the ordered binary symmetric channel

    Publication Year: 1995
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (92 KB)

    In this paper, different results related to the ordering of a sequence of N received symbols with respect to their reliability measure are presented for BPSK transmission over the AWGN channel View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast parallel decoding algorithm for general one-point AG codes with a systolic array architecture

    Publication Year: 1995
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (112 KB)

    We propose a fast parallel decoding algorithm for general one-point algebraic geometric (1-pt AG) codes with a systolic array architecture (SAA). This algorithm is able to correct up to half the Feng-Rao (see IEEE Trans. IT, vo1.39, no.1, p.37-45, 1993) bound and the time complexity is O(n) by using a series of O(n) processors where n is the code length and each processor is composed of τ cell... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized quickest change detection

    Publication Year: 1995
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    The problem of change detection is considered in a decentralized setting. A Bayesian framework is introduced for this problem, and an optimal solution is obtained for the case when the information structure in the system is quasiclassical View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • When is hard decision decoding enough?

    Publication Year: 1995
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (92 KB)

    Many algorithms for soft and near-soft decision decoding of block codes start by implementing hard decision decoding. In several instances it has been noted that simple tests of the hard decision result may allow the algorithm to terminate at this point. This paper explores this notion in detail View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving symmetric capacity of a L-out-of-K Gaussian channel using single-user codes and successive decoding schemes

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    We show that single-user codes and a modified successive decoding scheme can be used to achieve symmetric capacity of a L-out-of-K additive white Gaussian channel in all signal-to-noise ratios View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New construction of codes from algebraic curves

    Publication Year: 1995
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    A new construction of linear codes from algebraic curves is introduced. In essence, the construction is of the BCH type, namely, it is to extend the method of constructing BCH codes to the construction of codes from algebraic curves. As a consequence, a new class of codes is constructed without relying much on algebraic geometry. A comparison to algebraic-geometric codes from Hermitian curves show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A paradigm for distributed detection under communication constraints

    Publication Year: 1995
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    We present a new paradigm for the decentralized detection problem under communication constraints. In this problem, local sensors send a hard decision or the likelihood ratio itself to the fusion center based on the specified communication constraint. An optimal system is designed by minimizing the risk function. Also, a simpler system design procedure based on Ali-Silvey distances is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of the adaptive quantizer

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (92 KB)

    A probabilistic analysis of the adaptive quantizer DH is presented. For the case when the number of quantizer levels is equal to 4, mean square error-average entropy functions are calculated View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A two-step Markov point process

    Publication Year: 1995
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (104 KB)

    The existence and uniqueness are established for a translation-invariant Gibbs measure corresponding to a spatial point process that has, in addition to inhibition and clustering, the new-feature of penalizing isolated points. This point process has the so-called two-step Markov property, and the associated density function is characterized in terms of 2-interaction functions. The asymptotic norma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information set decoding complexity for linear codes in bursty channels with side information

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    General decoding algorithms for linear codes that have less complexity than exponential search have been studied by many researchers and exact complexities are known for the memoryless channel. Among the various decoding strategies for linear codes, the information set decoding algorithm has complexity that is significantly lower than that for most other general algorithms over most code rates. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice codes can achieve capacity on the AWGN channel

    Publication Year: 1995
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    It is shown that lattice codes (intersection of a sphere with a possibly translated lattice) can achieve capacity on the additive white Gaussian noise channel View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The trellis complexity of convolutional codes

    Publication Year: 1995
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    We develop a theory of minimal trellises for convolutional codes, and find that the “standard” trellis need not be the minimal trellis. We have found a simple algorithm for finding a generator matrix for a convolutional code, for which the corresponding “scalar” generator matrix is in “minimal span” form View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite field wavelet transforms and multilevel error protection

    Publication Year: 1995
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    A technique for providing unequal error protection is investigated. It relies on a transform approach to coding and makes use of the wavelet transform over finite fields. Reed-Muller codes, concatenated codes and dual codes are examined View full abstract»

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