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
  • Good k/(k+1) time-varying convolutional encoders from time-invariant convolutional codes

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

    This paper studies the construction of good time-varying convolutional codes from the relation between time-varying and time invariant encoding. In general, an k/n time-varying convolutional code can be described by p n×k generator matrices, where p is the time varying period. Such an k/n time-varying convolutional code may have better error protection capability than the best convolutional ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High diversity lattices for fading channels

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

    The practical interest in lattice constellations presenting good performance over fading channels arises from the need to transmit information at high bit rates over terrestrial mobile radio links. We show that particular versions of the densest lattice packings present very good performance over the Rayleigh fading channel. These versions not only have high diversity, but also may be decoded effi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new efficient coding method of a still image using three-dimensional DCT

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

    An efficient coding method using a three-dimensional discrete cosine transform (DCT) for still images is presented. This is an extended version of the traditional DCT coding method. The adaptive application of the three-dimensional DCT to each sub-block makes the coding more efficient than the other DCT methods View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two simple schemes for access control

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

    In an open information system, all the information in the system are known by the public. For such a system, the users are responsible for enciphering their own information in a way that they can be accessed by authorized users only. Let U={U1...,Un,) be the set of users in the system. Associated with each Ui is an authorization list Ai⊂U such that U... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel resolution of digital binary images

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

    A hierarchical scheme for chain encoded digital contours is introduced. If the contour represents the boundary of a binary image, a true digitization of the image is realized as the pyramid structure goes from the fine to coarser resolution levels. A progressive transmission system is designed to go from a coarse resolution level to finer levels which uses essentially the same number of bits as tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic processes and linear combinations of periodic clock changes

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

    Stochastic processes subjected to a periodic clock change function will have weighted versions of its power spectrum reproduced at integer multiples of the jitter frequency. It has been shown that the original process may, in theory, be reconstructed without error by a suitable choice of correction filter. We extend the results presented by Lacaze and Aakvaag (see ISIT'94) to the general case wher... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single-error-correcting codes for magnetic recording

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

    Magnetic and magneto-optical data recording uses a transition from one direction of magnetization to another to represent 1, and an absence of transition to represent 0. Due to physical and technological reasons the number of zeroes between two successive transitions is limited by a minimum d and a maximum k. Codes that satisfy these constraints are known as (d,k) run-length-limited modulation cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of digital cellular CDMA system with adaptive receiver

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

    This paper presents the results of a capacity evaluation for a cellular code-division multiple access (CDMA) system over a wideband fading channel. The study compares the performance of a system based on a conventional matched filter with that based on an adaptive receiver. Trellis codes and various rate convolutional codes are investigated in an attempt to improve the system performance. The perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric classification using radial basis function nets and empirical risk minimization

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

    We study convergence properties of radial basis function (RBF) networks in nonparametric classification for a large class of basis functions with parameters of RBF nets learned through empirical risk minimization. In the classification (pattern recognition) problem, based upon the observation of a random vector X∈Rd, one has to guess the value of a corresponding label Y, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast error magnitude evaluations for Reed-Solomon codes

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

    A fast algorithm for the evaluation of error magnitudes for Reed-Solomon codes is obtained here in terms of the error locations and syndromes. This fast algorithm is compared to the Forney algorithm (1965) in terms of required additions and multiplications and implementation speed 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.
  • On the probability of undetected error and the computational complexity to detect an error for iterated codes

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

    We discuss the practical and asymptotic capabilities of iterated codes used as error detecting codes. We assume that the codes are binary linear block codes, and the channel is a binary symmetric channel with cross-over probability ε View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of coding and design theory to constructing the maximum resilient systems of functions

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

    Some ideas, methods, and results of coding and design theory, especially a duality in bounding the optimal size of codes and designs (orthogonal arrays), are used to solve a new problem connected with randomized systems of functions. The problem is reduced to the minimization of the size of certain combinatorial designs, which we call split orthogonal arrays (SOA). We extend the linear programming... View full abstract»

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