By Topic

Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on

Date June 27 2004-July 2 2004

Filter Results

Displaying Results 1 - 25 of 577
  • Proceedings. 2004 IEEE International Symposium on Information Theory (IEEE Cat. No.04CH37522)

    Publication Year: 2004
    Request permission for commercial reuse | PDF file iconPDF (303 KB)
    Freely Available from IEEE
  • Proceedings 2004 IEEE International Symposium on Information Theory

    Publication Year: 2004, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • Copyright

    Publication Year: 2004, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (170 KB)
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2004, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (165 KB)
    Freely Available from IEEE
  • Program committee

    Publication Year: 2004, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (167 KB)
    Freely Available from IEEE
  • Acknowledgment of financial support

    Publication Year: 2004, Page(s): v
    Request permission for commercial reuse | PDF file iconPDF (265 KB)
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2004, Page(s): vi
    Request permission for commercial reuse | PDF file iconPDF (154 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2004, Page(s):vii - xxxviii
    Request permission for commercial reuse | PDF file iconPDF (268 KB)
    Freely Available from IEEE
  • Plenary Sessions

    Publication Year: 2004, Page(s):xxxix - xl
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (178 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

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

    Publication Year: 2004, Page(s):xli - xliv
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    Provides an abstract for each of the tutorial presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Blank page]

    Publication Year: 2004, Page(s): xlv
    Request permission for commercial reuse | PDF file iconPDF (154 KB)
    Freely Available from IEEE
  • On achievable rate regions for the Gaussian interference channel

    Publication Year: 2004
    Cited by:  Papers (4)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    This paper analyzes achievable rate regions for the Gaussian IFC (interference channel). The achievable rate region is based on reducing one user's transmit power to a point such that its message is decodeable to both receivers. The second receiver then does interference reduction. The main point of the paper is that the time-sharing of Sato's region exceeds the convex closure of a sub-region of H... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity approaching codes for relay channels

    Publication Year: 2004
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    In this paper, turbo-based coding scheme for relay systems together with iterative decoding algorithms is designed. The performance of the proposed schemes is about 1.0-1.5 dB away from the information theoretical limits for various channel models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An achievable rate for the multiple level relay channel

    Publication Year: 2004
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (237 KB) | HTML iconHTML

    This paper proposes a new coding scheme and proved a new achievable rate formula for the Gaussian case. The scheme is simpler and avoids some inconvenient techniques (e.g., the Slepian-Wolf partitioning), in giving the same achievable rate for the single relay case. More importantly, this new coding scheme is easier to extend to the multiple level relay case, and generally achieves higher rates. H... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved achievable rates for user cooperation and relay channels

    Publication Year: 2004
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    In this paper a new achievable rate region for the user cooperation channel is derived which exceeds the best-known result for this channel. Since the user cooperation channel includes many other known channels as a special case, the new rate region provides improved achievable rates for these cases. The most notable example is that of the Gaussian relay channel, for which we present a new closed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the trade-off between rate and performance of expander codes on AWGN channels

    Publication Year: 2004
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    This paper estimates threshold values of the message-passing iterative decoder for expander codes on discrete-input additive white Gaussian noise (AWGN) channels. We give a new upper bound on the rate of these codes and argue that expander codes are good codes at high rates on this channel. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On nearly-MDS expander codes

    Publication Year: 2004
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (258 KB) | HTML iconHTML

    A construction of graph codes is presented that approaches the singleton bound as the alphabet size goes to infinity. These codes can be decoded by a combined error-erasure decoder whose time complexity grows linearly with the code length. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance properties of expander codes

    Publication Year: 2004
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    A constructive family of expander codes is presented whose minimum distance exceeds the product (Zyablov) bound for all code rates between 0 and 1. Weight spectrum and the minimum distance of a random ensemble of bipartite-graph codes are computed. It is shown that if the vertex codes have minimum distance ≥3, the overall code is asymptotically good, and sometimes meets the Gilbert-Varshamov bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The average weight distribution of Tanner code ensembles and a way to modify them to improve their weight distribution

    Publication Year: 2004
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    This paper computes the asymptotic average weight distribution of Tanner code ensembles. The result obtained generalizes formulas, which were known for LDPC code ensembles. Also derive sufficient conditions ensuring that such a family contains a subfamily, which is asymptotically good and a ways to modify them to improve their weight distribution. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the entropy of a Hidden Markov process

    Publication Year: 2004
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    In this paper, the entropy rate of a hidden Markov process (HMP) is computed. The HMP entropy is expressed in terms of a measure Q, which solves an integral equation dependent on the parameters of the process. The measure is hard to extract from the equation in any explicit way. The study focuses on the regime where the channel parameter (noise) ε is small. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the entropy rate of a hidden Markov model

    Publication Year: 2004
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    In this article, the computation of the entropy rate H(y) of a binary-valued stochastic process (Y1, Y2,...) which is a function of a stationary, time-invariant and irreducible Markov chain (X1, X2,..) is considered. The central idea of this article is to replace the summation over all words of length n by a summation over a complete set of prefixes (or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the redundancy of HMM patterns

    Publication Year: 2004
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (237 KB) | HTML iconHTML

    In this paper the pattern redundancy of strings generated by hidden Markov models is bounded over unknown, possibly infinite alphabets, showing in particular that it diminishes to zero when the number of states is sufficiently small. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large deviations performance of predictors for Markov sources

    Publication Year: 2004
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    In this paper, an efficient procedure for designing a sequence of predictors with memory size equal to the Markov order of source, with error exponent arbitrarily close to the optimal error exponent is presented. In this procedure the moment-generating function of the prediction loss is recursively minimized. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient key agreement and signature schemes using compact representations in GF(p10)

    Publication Year: 2004
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB) | HTML iconHTML

    This paper presents a efficient key agreement and signature schemes using compact representations in GF(p10). We propose an analogous system using GF(p10) which gives a 60% reduction in bandwidth from the canonical representation. We also present a signature scheme based on a new problem called the trace discrete log problem (Trace-DLP problem). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secret key agreement from correlated source outputs using LDPC matrices

    Publication Year: 2004
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    A scheme of secret key agreement from correlated random numbers is described. It is proved that there is a pair of sparce matrices that yields a secret key agreement in the situation wherein a sender, a legitimate receiver, and an eavesdropper have access to correlated random numbers. View full abstract»

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