Scheduled System Maintenance
On Saturday, December 10, single article sales and account management will be unavailable from 5:00 AM-7:30 PM ET.
We apologize for the inconvenience.
By Topic

2009 IEEE Information Theory Workshop on Networking and Information Theory

12-10 June 2009

Filter Results

Displaying Results 1 - 25 of 78
  • [Front cover]

    Publication Year: 2009, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (453 KB)
    Freely Available from IEEE
  • [Title page]

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • [Copyright notice]

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

    Publication Year: 2009, Page(s):iii - iv
    Request permission for commercial reuse | PDF file iconPDF (69 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009, Page(s):v - x
    Request permission for commercial reuse | PDF file iconPDF (88 KB)
    Freely Available from IEEE
  • On oblivious transfer capacity

    Publication Year: 2009, Page(s):1 - 3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (174 KB) | HTML iconHTML

    The concept of oblivious transfer capacity has been introduced by Nascimento and Winter, ISIT06. Its value has been determined for certain models, and bounds to it were given for other models, in the present authors' ISIT07 contribution. This talk is based on the latter work. The tools include known results on secrecy capacity of simple source and channel models. View full abstract»

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

    Publication Year: 2009, Page(s): 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (40 KB)

    In this survey presentation, we consider Shannon-theoretic secret key generation by multiple parties for two categories of models. In the first category, termed source models, multiple terminals are provided prior and privileged access to correlated signals. In the second category, called channel models, these terminals are connected by a secure noisy channel with multiple input and outputs. In bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deterministic approach to wireless network error correction

    Publication Year: 2009, Page(s):5 - 9
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (129 KB) | HTML iconHTML

    In this paper we consider communication between two special nodes (ldquosourcerdquo and ldquodestinationrdquo) in a wireless relay network, which has malfunctioning or malicious nodes (inserting errors). We develop the model for wireless network communication in the presence of a Byzantine adversary for different assumptions on channel/adversarial knowledge. We examine coding schemes which utilize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustering phenomena in message-passing schemes

    Publication Year: 2009, Page(s):10 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB) | HTML iconHTML

    We examine the clustering phenomena of solutions to inference problems defined on graphs and its effect on message-passing algorithms. View full abstract»

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

    Publication Year: 2009, Page(s):13 - 16
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (123 KB) | HTML iconHTML

    Interference is a central feature of wireless communication. In many scenarios, interference is bursty: interfering wireless links come and go. Designing the system assuming interference to be always present is very conservative. In this paper, we take a fundamental information theoretic stand point and address the issue of statistical gain associated with bursty interference in the context of a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing goodness-of-fit via rate distortion

    Publication Year: 2009, Page(s):17 - 21
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (193 KB) | HTML iconHTML

    A framework is developed using techniques from rate distortion theory in statistical testing. The idea is first to do optimal compression according to a certain distortion function and then use information divergence from the compressed empirical distribution to the compressed null hypothesis as statistic. Only very special cases have been studied in more detail, but they indicate that the approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding efficiency and reliability in probe-based storage devices

    Publication Year: 2009, Page(s):22 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    High density probe-based storage devices use multiple, simultaneously accessed parallel channels for achieving high I/O data rates. This paper presents an analytical methodology for evaluating the performance of coding and interleaving schemes in such devices, when they are affected by burst errors. Markov processes are used to describe the burstiness of errors due to external disturbances and ana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing optimal whole-bit recycling codes

    Publication Year: 2009, Page(s):27 - 31
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (218 KB) | HTML iconHTML

    Bit recycling aims at improving the rates achieved by compression techniques, such as LZ77, that suffer from the redundancy caused by the multiplicity of the encodings. The performance of bit recycling depends crucially on the recycling codes that it uses. A recipe for the construction of optimal recycling codes has been mentioned in previous work. However, no efficient algorithm and proof of opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the random coding exponent of nonlinear gaussian channels

    Publication Year: 2009, Page(s):32 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (158 KB) | HTML iconHTML

    A random coding theorem for nonlinear additive Gaussian channels is presented. Modeling the channel's nonlinear behavior as a causal, stationary Volterra system and under maximum likelihood decoding, an upper bound on the average error probability is obtained. The proposed bound is deduced by deploying exponential martingale inequalities. Cubic nonlinearities are used as example to illustrate the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure bits through queues

    Publication Year: 2009, Page(s):37 - 41
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (343 KB) | HTML iconHTML

    We investigate the idea of providing information-theoretic security at the network and data link layers by exploiting the timing information resulting from queuing of packets between a source, an intended receiver, and other users in a network. Specifically, we consider the secure transmission of messages by encoding them onto the interarrival timing of packets that enter parallel queues. By lever... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Instantaneous forwarding strategies for relay channels with known interference

    Publication Year: 2009, Page(s):42 - 46
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (205 KB) | HTML iconHTML

    We consider a Gaussian relay channel, with the source and relay operating in different frequency bands. Hence, the received signals at the destination are orthogonal. We also assume that the source reuses the frequency band in which the relay is operating, to communicate with another destination. This results in a scenario that can be modeled in such a way that the relay-destination link suffers f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relaying simultaneous multicast messages

    Publication Year: 2009, Page(s):47 - 51
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    The problem of multicasting multiple messages with the help of a relay, which may also have an independent message of its own to multicast, is considered. As a first step to address this general model, referred to as the compound multiple access channel with a relay (cMACr), the capacity region of the multiple access channel with a ldquocognitiverdquo relay is characterized, including the cases of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multirelay channel with non-ergodic link failures

    Publication Year: 2009, Page(s):52 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    A multi-relay network is considered in which communication from source to relays takes place over a (discrete or Gaussian) broadcast channel, while the relays are connected to the receiver via orthogonal finite-capacity links. Unknown to the source and relays, link failures may take place between any subset of relays and destination in a non-ergodic fashion. Upper and lower bounds are derived on a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity region of the deterministic multi-pair bi-directional relay network

    Publication Year: 2009, Page(s):57 - 61
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    In this paper we study the capacity region of the multi-pair bidirectional (or two-way) wireless relay network, in which a relay node facilitates the communication between multiple pairs of users. This network is a generalization of the well known bidirectional relay channel, where we have only one pair of users. We examine this problem in the context of the deterministic channel interaction model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical SVMs for robust detection, supervised learning, and universal classification

    Publication Year: 2009, Page(s):62 - 66
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    The support vector machine (SVM) has emerged as one of the most popular approaches to classification and supervised learning. It is a flexible approach for solving the problems posed in these areas, but the approach is not easily adapted to noisy data in which absolute discrimination is not possible. We address this issue in this paper by returning to the statistical setting. The main contribution... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the residual waiting time for binary stationary time series

    Publication Year: 2009, Page(s):67 - 70
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (121 KB) | HTML iconHTML

    We present here a universal estimation scheme for the problem of estimating the residual waiting time until the next occurrence of a zero after observing the first n outputs of a stationary and ergodic binary process. The scheme will involve estimating only at carefully selected stopping times but will be almost surely consistent. In case the process happens to be a genuine renewal process then ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An MSE-tunable linear estimator with conditional dominance over least-squares estimation

    Publication Year: 2009, Page(s):71 - 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    In the paper, we propose a conditionally biased linear estimator to estimate a deterministic vector h subjected to a linear transformation M and corrupted by zero-mean additive white Gaussian noise, w. We begin by drawing inspiration from the rank shaping idea of the Rank Shaped Least Squares (RSLS) estimator. We then incorporate the estimator into the Covariance Shaping Least Squares (CSLS) frame... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed computation of symmetric functions with binary inputs

    Publication Year: 2009, Page(s):76 - 80
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    This paper considers the following network computation problem: n nodes are placed on a radic(n)timesradic(n) grid, each node in the network is connected to every other node within distance r(n) of itself, and is given an arbitrary input bit. Connected nodes communicate with each other over independent binary symmetric channels of a given transition probability epsiv ges 0, and an arbitrarily desi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limited feedback for multicarrier block fading channels: A rate distortion approach

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

    This paper studies power loading in a multicarrier system with channel state feedback of no more than one bit per sub-channel. Full channel state information is assumed known at the receiver. A simple model with parallel two-state (good/bad) memoryless sub-channels is considered first, where feedback is used to select a given fraction of sub-channels to activate. The optimal feedback scheme is the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On LDPC codes over symmetric channels

    Publication Year: 2009, Page(s):86 - 90
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (121 KB) | HTML iconHTML

    In the past decade, there has been tremendous amount of research on the analysis and design of the Low-Density Parity-Check (LDPC) codes with belief propagation decoding over different types of Binary-Input Output-Symmetric Memoryless (BIOSM) channels. However, with the exception of the Binary Erasure Channel (BEC), analytical results on LDPC codes over such channels are limited and most results a... View full abstract»

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