Proceedings of IEEE International Symposium on Information Theory

June 29 1997-July 4 1997

Filter Results

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

    Publication Year: 1997
    Request permission for commercial reuse | |PDF file iconPDF (1569 KB)
    Freely Available from IEEE
  • Data-punctuated token trees

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

    Summary form only given. In the problem we consider, one party (the "receiver") seeks to obtain a copy of a large file or unstructured database from another party (the "source") over a communication link which is slow or expensive relative to the computing power available at each end. The communication link is bi-directional, and error-free in both directions, although it may have delay. The recei... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The AVC with noiseless feedback and maximal error probability: a capacity formula with a trichotomy

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

    Summary form only given. To use common randomness in coding is a key idea from the theory of identification. Methods and ideas of this theory are shown here to have also an impact on Shannon's theory of transmission. We determine the capacity for a classical arbitrarily varying channel (AVC) (Ahlswede, 1973) with a novel structure of the capacity formula. This channel models a robust search proble... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trellis code construction for the joint source-channel problem

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

    Summary form only given, as follows. The theory of source coding with a fidelity criterion for the noiseless channel establishes the existence of codes which permits to achieve the theoretical "rate-distortion" function. In general, the most known algorithms for vector quantization can be divided into two groups: block codes of length N and sliding block codes more commonly named trellis codes. Tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced-search BCJR algorithms

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

    Summary form only given. There is great interest in coding systems that employ various kinds of code concatenation. In all of these schemes, an important element in the decoder is the MAP decoder, a device that puts out the probability of trellis states or data bits, rather than simply the most likely state or bit. For trellis encoding and Markov data, the MAP decoder is a special scheme, the BCJR... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-error capacity for models with memory and the enlightened dictator channel

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

    Summary form only given. We present a general class of "combinatorial" 0-error capacity problems with the "memory" covering known and many new cases. This class can be incorporated into a model of channels with memory. W analyse a seemingly basic channel in this class, which we call the "dictator channel". Clearly, a dictator always follows his own opinion. However, we speak of an enlightened dict... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Turbo coding with differentially coherent and non-coherent modulation on non-fading and fading channels

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

    This paper determines the performance of the turbo coding technique using M-ary (M=2, 4, 8) differentially coherent and non-coherent modulation schemes in both a non-fading and a Rayleigh fading environment. The constituent codes are convolutional and the specific modulation techniques include differential phase shift keying (DPSK), double differential phase shift keying (DDPSK), and non-coherent ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel coding considerations for wireless LAN's

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

    This paper investigates various channel coding options for wireless local area networks. The channel is impaired by multipath fading, intersymbol interference, and additive noise. Three equalization options are considered: linear equalization, decision feedback equalization, and maximum likelihood sequence estimation. Three high rate coding options are also considered: Hamming codes, Reed-Solomon ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bootstrap hybrid decoding using the multiple stack algorithm

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

    When in 1948 Claude Shannon published his landmark paper on the mathematical theory of communication, he showed that the error probability in transmitting a message over a noisy channel could be made as small as desired if the information rate was below a certain value, called the capacity, characteristic of the channel. Since his arguments were based on random codes with undefined encoding/decodi... View full abstract»

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

    Publication Year: 1997, Page(s):537 - 542
    Request permission for commercial reuse | |PDF file iconPDF (350 KB)
    Freely Available from IEEE
  • Complexity distortion theory

    Publication Year: 1997
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (108 KB)

    We investigate the efficiency of lossy algorithmic representations of information and show that “complexity distortion” is asymptotically equivalent to rate distortion for stationary ergodic sources View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-resolution source coding for non-difference distortion measures: the rate distortion function

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

    The problem of asymptotic (i.e., low-distortion) behavior of the rate-distortion function of a random vector is investigated for a class of non-difference distortion measures. The main result is an asymptotically tight expression which parallels the Shannon lower bound for difference distortion measures. Applications include remote source coding and high resolution quantization theory for non-diff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Attaining Forney's bound for erasure decision by likelihood-ratio test plus threshold decision

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

    We propose a new erasure decision scheme for decoding with erasures and show that the scheme also attains the bounds on the erasure probability and undetected error probability which are first derived for Forney's (1968) optimal scheme. The new scheme gives, when applied to convolutional codes, bounds which are related to those for block codes by Forney's inverse concatenation construction without... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A type generator model for adaptive lossy compression

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

    We propose a random coding model which gives insight into the underlying mechanism of lossy string-matching algorithms. This idealised model is based on manipulating types rather than codewords. We model the adaptive codebook as a mixed type random code, whose type distribution evolves with time as its dimension increases. The model behavior exhibits a mechanism of natural type selection which rei... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent turbo-decoding

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

    The turbo-decoding algorithm can be viewed as a message passing procedure on a graph. We contrast the standard “forward-backward” turbo-decoding algorithm with a new “concurrent” algorithm that is suited to parallel implementation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simplistic, universal lossy source code

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

    A conceptually simple lossy source code, achieving distortion at most D, may be described as follows. A source sequence of length n from a finite alphabet A is parsed into blocks of some length k<n, which are placed in a dictionary. Among all potential codebooks containing source sequences of length k, one selects the smallest one such that every member of the dictionary is within distortion D ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concordant and partially concordant ring convolutional codes for CPFSK

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

    We consider new M-ary convolutional codes over the ring of integers ZM for full response continuous phase frequency shift keying (CPFSK) with modulation index h=p/g, where positive integers p and q have no common factors. In comparison with the other best known constructions of encoded CPFSK, our encoder is feedback-free. The new trellis codes are designed for additive white Gaussian no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis

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

    Suppose a binary linear block code C with weight profile W is used for error control over the AWGN channel. A codeword c is mapped into the BPSK sequence x. Let r denote the received noisy vector and z=(z1 ,...,zN) denote the corresponding bit-by-bit hard decoded sequence. Let VN represent the set all binary N-tuples. For u=(u1,...,uN) in V View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed-normal lossy Lempel-Ziv algorithm

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

    The idea of a lossy Lempel-Ziv algorithm is to find a scheme that maps a sequence uin ε 𝒜n into a binary sequence LZ(uˆ1n) such that the pair (ρ(uin,uˆ1n), |LZ(uˆ1n)|/n) converges asymptotically to a point on the source rate-distortion curve, where u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of high diversity multidimensional constellations

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

    We evaluate analytically the performance of component-interleaved multidimensional constellations over the Rayleigh fading channel. The concept of modulation diversity was introduced by Boutros and Viterbo (see IEEE Information Theory Workshop, Haifa, Israel, 1996) as a way to enhance the error performance of communication systems over the Rayleigh fading channel. Several multidimensional signal s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance upper bounds for breadth first search detection over finite interference channels

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

    We derive an upper bound on the bit error probability in breadth first limited search detection over a finite interference channel, which includes finite length ISI channels and multiuser channels as two special cases. We show that the bit error probability of the breadth first algorithm is bounded from above by the sum of three terms: the Forney (1972) upper bound on the error probability in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Array codes for correction of criss-cross errors

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

    We present MDS array codes of size (p-1)×(p-1), p is a prime number, that can correct any row or column in error without a priori knowledge of what type of error that has occurred. The complexity of the encoding and decoding algorithms is lower than that of known codes with the same error-correcting power, since our algorithms are based on exclusive-OR operations over lines of different slop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal decoding strategy for a simple concatenated coding scheme

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

    For a simple concatenated coding scheme, the decoding strategy for the inner code is optimized such that the number of correctable errors in a concatenated codeword is maximum View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A universal data compression with common side information

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

    We consider the coding problem of a source X when the sender and the receiver has access to a common source Y which is correlated with X. This problem is closely related to that of coding correlated sources which were studied by Slepian and Wolf (1973) in the noiseless case, and also to that of the source coding with side information at the decoder studied by Wyner and Ziv (1976) in the semifaithf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of a new class of codes from generalized Hermitian curves

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

    A new class of linear codes is constructed from generalized Hermitian curves. The codes are distinct from algebraic-geometric codes. It is shown that these new codes are better than some of the AG codes on Garcia and Stichtenoth (see Inventions Mathematics, vol.121, p.211-22, 1995) curves View full abstract»

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