2008 IEEE International Symposium on Information Theory

6-11 July 2008

Filter Results

Displaying Results 1 - 25 of 570
  • 2008 IEEE international symposium on information theory

    Publication Year: 2008, Page(s): c1
    Request permission for reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • Proceedings 2008 IEEE international symposium on information theory

    Publication Year: 2008, Page(s): i
    Request permission for reuse | PDF file iconPDF (50 KB)
    Freely Available from IEEE
  • [Copyright and reprint permission]

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

    Publication Year: 2008, Page(s):iii - iv
    Request permission for reuse | PDF file iconPDF (86 KB)
    Freely Available from IEEE
  • Acknowledgement of financial support

    Publication Year: 2008, Page(s):v - vi
    Request permission for reuse | PDF file iconPDF (149 KB) | HTML iconHTML
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2008, Page(s):vii - xlii
    Request permission for reuse | PDF file iconPDF (220 KB)
    Freely Available from IEEE
  • Claude E. Shannon Award lecture

    Publication Year: 2008, Page(s):xliii - xlvi
    Request permission for reuse | PDF file iconPDF (128 KB)
    Freely Available from IEEE
  • Interference in ad hoc networks with general motion-invariant node distributions

    Publication Year: 2008, Page(s):1 - 5
    Cited by:  Papers (23)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    In this paper we derive the tail properties of interference for any stationary and isotropic spatial distribution of transmitting nodes. Previously the properties of interference were known only when the nodes are distributed as a homogeneous Poisson point process on the plane. We show the effect of a singular path loss model on the tail distribution of the interference. When the path loss functio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information propagation speed in Delay Tolerant Networks: Analytic upper bounds

    Publication Year: 2008, Page(s):6 - 10
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (161 KB) | HTML iconHTML

    Delay/disruption tolerant networks (DTNs) or intermittently connected mobile networks (ICNs) are mobile ad hoc networks where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. While most of the research is dedicated to the design of routing protocols, very few properties of such networks are known. In a recent paper [6], the authors ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximizing reliability in multi-hop wireless networks

    Publication Year: 2008, Page(s):11 - 15
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (314 KB) | HTML iconHTML

    Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This paper proposes a new distributed space-time block code called the cascaded orthogonal space-time block code (COSTBC) for the case where the source and destination are equipped with m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability constrained packet-sizing for linear multi-hop wireless networks

    Publication Year: 2008, Page(s):16 - 20
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    We consider optimizing the packet-sizes and the reuse factor to minimize the delay required to send a message between two nodes in a linear multi-hop wireless network subject to a reliability constraint. Initially assuming no re-use, we give a bound on the required delay. Next, in an infinite system with re-use, we analyze the rate of growth of the delay as a function of the message size. Two case... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power and rate adaptation for wireless network coding with opportunistic scheduling

    Publication Year: 2008, Page(s):21 - 25
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (241 KB) | HTML iconHTML

    This paper analyzes the average capacity for a wireless network with joint opportunistic scheduling and wireless network coding. The capacity and the optimal power allocation scheme are derived for a multiuser fading broadcasting channel with perfect channel side information at the transmitter. The packets generated by the source nodes are encoded prior to the transmission to the relay node. The r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pruning network coding traffic by network coding — A new max-flow algorithm

    Publication Year: 2008, Page(s):26 - 30
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (149 KB) | HTML iconHTML

    For a unicast/multicast session, network coding is generally implemented via random coding and broadcasting at intermediate nodes, an especially favorable solution in wireless networks. The corresponding broadcast traffic can be minimized by finding the max (s, t)-flow of the network and by sending packets only along the max flow. All existing algorithms for this task, e.g. the push-&-relabel ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability analysis of random linear coding across multicast sessions

    Publication Year: 2008, Page(s):31 - 35
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    We consider a problem of managing separate multicast sessions from a single transmitter. Each of K sessions has an associated packet stream, and a single transmitter must transmit these packet streams to a group of receivers. The multicast sessions are separate in the sense that each receiver only wants packets from one of the K streams. We will compare the maximum stable arrival rates that can be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-rate network coding for minimum-cost multicasting

    Publication Year: 2008, Page(s):36 - 40
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (126 KB) | HTML iconHTML

    We consider multicast network codes that allow to tradeoff throughput against cost. We construct a single code that enables the source to control the throughput, always achieving the minimum possible cost per transmitted symbol. Nodes in the network perform linear coding operations that are the same for all achievable throughput-cost pairs. On each of their outgoing edges nodes transmit either sym... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate distortion region for distributed source coding of correlated Gaussian remote sources

    Publication Year: 2008, Page(s):41 - 45
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    We consider the separate source coding problem of L correlated Gaussian observations Y<sub>i</sub>, i=1, 2,hellip, L. We consider the case that Y<sub>i</sub>, i=1, 2,hellip, L satisfy Y<sub>i</sub>=X<sub>i</sub>+N<sub>i</sub>, i=1, 2,hellip, L where X<sub>i</sub>, i=1, 2,hellip, L are L correlated Gaussian random variables and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Byzantine CEO Problem

    Publication Year: 2008, Page(s):46 - 50
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    The CEO problem is considered when a subset of the agents are under Byzantine attack; that is, they have been taken over and reprogrammed by a malicious intruder. Inner and outer bounds are given for the error exponent with respect to the sum rate, as a function of the fraction of reprogrammed, or traitor, agents. The inner bound is proved by introducing a coding scheme that takes advantage of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-terminal distributed source coding with alternating messages for function computation

    Publication Year: 2008, Page(s):51 - 55
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (177 KB) | HTML iconHTML

    A two-terminal interactive distributed source coding problem with alternating messages is studied. The focus is on function computation at both locations with a probability which tends to one as the blocklength tends to infinity. A single-letter characterization of the rate region is provided. It is observed that interaction is useless (in terms of the minimum sum-rate) if the goal is pure source ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An achievable rate region for distributed source coding with reconstruction of an arbitrary function of the sources

    Publication Year: 2008, Page(s):56 - 60
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (139 KB) | HTML iconHTML

    A new rate region is presented for a general framework of distributed source coding where the decoder is interested in lossy reconstruction of an arbitrary function of the sources. The coding scheme involves vector quantization of the sources followed by "correlated" binning. Nested linear codes are used for quantization and binning as against the more prevalent random codes. Our rate region recov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Neyman-Pearson approach to universal erasure and list decoding

    Publication Year: 2008, Page(s):61 - 65
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    We study communication over an unknown, possibly unreliable, discrete memoryless channel. For such problems, an erasure option at the decoder is desirable. We use constant-composition random codes and propose a generalization of the Maximum Mutual Information decoder. The proposed decoder is parameterized by a weighting function that can be designed to optimize the fundamental tradeoff between und... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List decoding of burst errors

    Publication Year: 2008, Page(s):66 - 70
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (215 KB) | HTML iconHTML

    A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed-Solomon codes attain this bound. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error exponents for two soft decision decoding algorithms of Reed-Muller codes

    Publication Year: 2008, Page(s):71 - 75
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    Error exponents are studied for the recursive and majority decoding algorithms of general Reed-Muller codes RM(r, m) used on the AWGN channels. Both algorithms have low decoding complexity and substantially outperform bounded distance decoding in their error-correcting capabilities. We obtain asymptotically tight upper bounds on the output error rate that hold for both algorithms and can be used f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Soft-decision decoding using time and memory diversification

    Publication Year: 2008, Page(s):76 - 80
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    In this paper, the idea of diversification is applied to box-and-match technique and a multi-basis-multi-box decoding algorithm is developed for soft-decision decoding of binary linear block codes. New preprocessing techniques are also employed to improve computational efficiency. These new techniques allow to achieve near maximum likelihood decoding of the (256,131) extended BCH code, which has n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Private classical capacity with symmetric assistance

    Publication Year: 2008, Page(s):81 - 85
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    We study the symmetric-side-channel-assisted private capacity of a quantum channel, for which we provide a single- letter formula. This capacity is additive, convex, and, for degradable channels, equal to the unassisted private capacity. While a channel's (unassisted) capacity for private classical communication may be strictly larger than its quantum capacity, we will show that these capacities a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classical capacity of averaged quantum channels

    Publication Year: 2008, Page(s):86 - 90
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (237 KB) | HTML iconHTML

    In this paper we extend recent coding results by Datta and Dorlas on classical capacity of averaged quantum channels with finitely many memoryless branches to arbitrary number of branches. Only assumption in our approach is that the channel satisfies some weak measurability properties. Our approach to the direct coding theorem is based on our previous work on compound classical-quantum channels. T... View full abstract»

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