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
  • The effect of space diversity on coded modulation for the fading channel

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

    We address the problem of designing a coded modulation scheme for the fading channel when space diversity is used. We focus on the fact that a channel affected by fading can be asymptotically turned into an additive white Gaussian noise (AWGN) channel by increasing the number of diversity branches, thus turning coded-modulation schemes designed for the AWGN channel into efficient codes over the fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing the encoder/decoder structures in a discrete communication system

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

    The problem of optimizing the structure of the encoder/decoder pair in a discrete communication system (with an additive distortion measure) is expressed in terms of a bilinear programming problem (BLP Problem). An efficient method, based on the simplex search in conjunction with the generalized upper bounding technique is presented for the solution. The special features of the problem are exploit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single-track Gray codes

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

    A common use of Gray codes is in reducing quantisation errors in various types of analogue-to-digital conversion systems. As a typical example, a length n Gray code can be used to record the absolute angular positions of a rotating wheel by encoding the codewords on n concentrically arranged tracks. A number of reading heads, n, mounted radially across the trades, suffice to recover the codewords ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noisy attractors of Markov maps

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

    It is shown that Markov maps when subjected to weakly continuous random perturbations have an attractive invariant measure that incorporates the dispersive effects of perturbations as well as the ordering effects of the mapping. Under any translational invariant perturbation a Markov map always has an attractive invariant measure. Interesting features of the noisy invariant measure are that it sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for low complexity detection of multiple insertion/deletion errors

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

    Two new methods for the detection of multiple insertion/deletions are presented. The first method recognises insertions/deletions in the previous symbol stream by extracting additional information from commonly used markers. A new coding method is also presented that relies on the number of transitions in a codeword to detect insertions/deletions in the previous codeword. This coding scheme also h... 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.
  • On the existence of strongly consistent rules for estimation and classification

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

    Suppose we observe x1,x2,…ε𝒳 drawn i.i.d. according to some unknown distribution P selected from a family of distributions 𝒫. Let f:𝒫→Λ be a parameterisation of P∈𝒫. In this paper, we study necessary and sufficient conditions for the existence of strongly consistent estimators of f(P). A number of previous results along these l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Operational rate distortion theory

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

    The paper treats data compression from the viewpoint of information theory where a certain error probability is tolerable. We obtain bounds for the minimal rate given an error probability for block coding of general stationary ergodic sources. An application of the theory of large deviations provides numerical methods to compute for memoryless sources, the minimal compression rate given a tolerabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On properties of binary maxentropic DC-free runlength-limited sequences

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

    We present the most remarkable results obtained from a numerical analysis of relevant statistical properties of binary maxentropic DC-free runlength-limited (DCRLL) sequences. In particular, we consider the sum variance and its relation to the low-frequency characteristic or the redundancy. Further, we present an approximation of the runlength distribution of binary maxentropic pure charge constra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On efficient high-order spectral-null codes

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

    Let S(N,q) be the set of all words of length N over the bipolar alphabet {-1,+1}, having a q-th order spectral-null at zero frequency. Any subset of S(N,q) is a spectral-null code of length N and order q. We give an equivalent formulation of S(N,q) in terms of codes over the binary alphabet {0,1}. We show that S(N,2) is equivalent to a well known class of single error correcting, all unidirectiona... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Restricted two-way channel: bounds for achievable rates region for given error probability exponents

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

    Shannon's (1961) restricted two-way channel is studied. The outer and the inner bounds are obtained of the region of rates achievable when error probabilities exponentially decrease with given at two outputs exponents. The inner bound is obtained using the Shannon's random coding method, and upper bound is constructed by the combinatorial method proposed by Haroutunian (1982) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-way alternating minimization

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

    In a K-way minimization problem, we are interested in finding min (x1∈S1) ··· min (xK ∈SK) f(x1, ···, x K), where f is continuous and bounded from below, and Si is a compact convex set in IR(ni), 1⩽i⩽K. In a paper by Csiszar and Tusnady (1984), a simi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distortion measures via parametric filtering

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

    Distortion measures are proposed on the basis of parametric filtering, a technique of signal characterization that combines a parametric filter bank with an analysis of first-order autocorrelation. The robustness of the distortion measures against narrow-band interference and spectral notch filtering is investigated View full abstract»

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