By Topic

Information Theory, IEEE Transactions on

Issue 10 • Date Oct. 2011

Filter Results

Displaying Results 1 - 25 of 64
  • Table of contents

    Publication Year: 2011 , Page(s): C1 - C4
    Save to Project icon | Request Permissions | PDF file iconPDF (52 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2011 , Page(s): C2
    Save to Project icon | Request Permissions | PDF file iconPDF (140 KB)  
    Freely Available from IEEE
  • When Is a Function Securely Computable?

    Publication Year: 2011 , Page(s): 6337 - 6350
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4308 KB) |  | HTML iconHTML  

    A subset of a set of terminals that observe correlated signals seek to compute a function of the signals using public communication. It is required that the value of the function be concealed from an eavesdropper with access to the communication. We show that the function is securely computable if and only if its entropy is less than the capacity of a new secrecy generation model, for which a sing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Extracting Common Random Bits From Correlated Sources

    Publication Year: 2011 , Page(s): 6351 - 6355
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1444 KB) |  | HTML iconHTML  

    Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of random bits with high probability but without communicating. How many such bits can they extract? The trivial strategy of outputting the first k bits yields an agreement probability of (1-ε)k <; 2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Recursive Construction of the Set of Binary Entropy Vectors and Related Algorithmic Inner Bounds for the Entropy Region

    Publication Year: 2011 , Page(s): 6356 - 6363
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1890 KB) |  | HTML iconHTML  

    A method for checking membership in the region of entropic vectors generated from N bits is presented. A general technique for utilizing this method to create inner bounds for regions of entropic vectors as a function of outer bounds is then presented. These two algorithms are then used to provide new insights regarding relationships among well known bounds for the region of entropic vector... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Truncation Technique for Characterizing Linear Polymatroids

    Publication Year: 2011 , Page(s): 6364 - 6378
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3635 KB) |  | HTML iconHTML  

    Linear polymatroids have a strong connection to network coding. The problem of finding the linear network coding capacity region is equivalent to the characterization of all linear polymatroids. It is well known that linear polymatroids must satisfy the inequalities of Ingleton (Combin. Math. Appln., 1971). However, it has been an open question for years as to whether these inequalities are suffic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message and State Cooperation in Multiple Access Channels

    Publication Year: 2011 , Page(s): 6379 - 6396
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4936 KB) |  | HTML iconHTML  

    We investigate the capacity of a multiple access channel with cooperating encoders where partial state information is known to each encoder and full state information is known to the decoder. The cooperation between the encoders has a two-fold purpose: to generate empirical state coordination between the encoders, and to share information about the private messages that each encoder has. For two-w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Capacity of Several New Classes of Semi-Deterministic Relay Channels

    Publication Year: 2011 , Page(s): 6397 - 6404
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2056 KB) |  | HTML iconHTML  

    The relay channel consists of a transmitter input x1, a relay input x2, a relay output y2 , and a receiver output y3. In this paper, we establish the capacity of three new classes of semi-deterministic relay channels: 1) a class of degraded semi-deterministic relay channels, 2) a class of semi-deterministic orthogonal relay ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achievable Rate Regions and Performance Comparison of Half Duplex Bi-Directional Relaying Protocols

    Publication Year: 2011 , Page(s): 6405 - 6418
    Cited by:  Papers (49)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3995 KB) |  | HTML iconHTML  

    In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and compare these to four existing half-duplex protocols and outer bounds. In time, our protocols consist of either two or three phases. In the two phase protocols,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Achievable Distortion Region of Sending a Bivariate Gaussian Source on the Gaussian Broadcast Channel

    Publication Year: 2011 , Page(s): 6419 - 6427
    Cited by:  Papers (17)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (519 KB) |  | HTML iconHTML  

    We provide a complete characterization of the achievable distortion region for the problem of sending a bivariate Gaussian source over bandwidth-matched Gaussian broadcast channels, where each receiver is interested in only one component of the source. This setting naturally generalizes the simple single Gaussian source bandwidth-matched broadcast problem for which the uncoded scheme is known to b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes

    Publication Year: 2011 , Page(s): 6428 - 6443
    Cited by:  Papers (49)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (392 KB) |  | HTML iconHTML  

    Suppose that Alice wishes to send messages to Bob through a communication channel C1, but her transmissions also reach an eavesdropper Eve through another channel C2. This is the wiretap channel model introduced by Wyner in 1975. The goal is to design a coding scheme that makes it possible for Alice to communicate both reliably and securely. Reliability is measured in terms o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact Random Coding Exponents for Erasure Decoding

    Publication Year: 2011 , Page(s): 6444 - 6454
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (286 KB) |  | HTML iconHTML  

    Random coding of channel decoding with an erasure option is studied. By analyzing the large deviations behavior of the code ensemble, we obtain exact single-letter formulas for the error exponents in lieu of Forney's lower bounds. The analysis technique we use is based on an enhancement and specialization of tools for assessing the statistical properties of certain distance enumerators. We special... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous Communication in Noisy Channels

    Publication Year: 2011 , Page(s): 6455 - 6462
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2100 KB) |  | HTML iconHTML  

    A sender wishes to broadcast a message of length n over an alphabet to r users, where each user i, 1 ≤ i ≤ r, should be able to receive one m, possible messages. The broadcast channel has noise for each of the users (possibly different noise for different users), who cannot distinguish between some pairs of letters. The vector (m1, m2,...,mr)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compute-and-Forward: Harnessing Interference Through Structured Codes

    Publication Year: 2011 , Page(s): 6463 - 6486
    Cited by:  Papers (209)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (674 KB) |  | HTML iconHTML  

    Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea is that relays should decode linear functions of transmitted messages according to their observed channel coefficients rather than ignoring the interfere... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outage Analysis of Block-Fading Gaussian Interference Channels

    Publication Year: 2011 , Page(s): 6487 - 6501
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (552 KB) |  | HTML iconHTML  

    This paper considers the asymptotic behavior of the outage probability of a two-source block-fading single-antenna Gaussian interference channel in the high-SNR regime by means of the diversity-multiplexing tradeoff. A general setting where the user rates and the average channel gains are not restricted to be symmetric is investigated. This asymmetric scenario allows to analyze networks with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lower Bound on the Capacity of Wireless Erasure Networks

    Publication Year: 2011 , Page(s): 6502 - 6513
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1898 KB) |  | HTML iconHTML  

    In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the case where n nodes are uniformly and independently distributed in the unit area square. It holds almost surely and is asymptotically tight. Nodes are assumed to have fixed transmit power; hence, two nodes should be within a specified distance rn to overcome noise. With inter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Opportunistic Wireless Relay Networks: Diversity-Multiplexing Tradeoff

    Publication Year: 2011 , Page(s): 6514 - 6538
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4399 KB) |  | HTML iconHTML  

    The performance of many opportunistic relay networks has been unknown in part because opportunistic analysis relies on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks, proposes new opportunistic methods for several network geometries, and analyzes them in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Rate Allocation for Wireless Networks

    Publication Year: 2011 , Page(s): 6539 - 6554
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (472 KB) |  | HTML iconHTML  

    This paper develops a distributed algorithm for rate allocation in wireless networks that achieves the same throughput region as optimal centralized algorithms. This cross-layer algorithm jointly performs medium access control and physical-layer rate adaptation. The paper establishes that this algorithm is throughput-optimal for general rate regions. In contrast to on-off scheduling, rate allocati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Diversity With Mobile Nodes: Capacity Outage Rate and Duration

    Publication Year: 2011 , Page(s): 6555 - 6568
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3217 KB) |  | HTML iconHTML  

    The outage probability is an important performance measure for cooperative diversity schemes. However, in mobile environments, the outage probability does not completely describe the behavior of cooperative diversity schemes since the mobility of the involved nodes introduces variations in the channel gains. As a result, the capacity outage events are correlated in time and second-order statistica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Diversity-Multiplexing Tradeoff of the Dynamic Decode-and-Forward Protocol on a MIMO Half-Duplex Relay Channel

    Publication Year: 2011 , Page(s): 6569 - 6590
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (5571 KB) |  | HTML iconHTML  

    The diversity-multiplexing tradeoff of the dynamic decode-and-forward protocol is characterized for the half-duplex three-terminal (m, k, n)-relay channel where the source, relay and the destination terminals have m, k and n antennas, respectively. The tradeoff curve is obtained as a solution to a simple, two-variable, convex optimization problem which is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beamforming Codebooks for Two Transmit Antenna Systems Based on Optimum Grassmannian Packings

    Publication Year: 2011 , Page(s): 6591 - 6602
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2260 KB) |  | HTML iconHTML  

    Precoding codebook design for limited feedback MIMO systems is known to reduce to a discretization problem on a Grassmann manifold. The case of two-antenna beamforming is special in that it is equivalent to quantizing the real sphere. The isometry between the Grassmannian G2,1 and the real sphere S2 shows that discretization problems in the Grassmann... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beam Selection Gain Versus Antenna Selection Gain

    Publication Year: 2011 , Page(s): 6603 - 6618
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4650 KB) |  | HTML iconHTML  

    We consider beam selection using a fixed beamforming network (FBN) at a base station with M array antennas. In our setting, a Butler matrix is deployed at the RF stage to form M beams, and then the best beam is selected for transmission. We introduce some properties of the noncentral chi-square distribution and prove the resulting properties of the beam selection gain verifying that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Communication Over Unknown Sparse Frequency-Selective Block-Fading Channels

    Publication Year: 2011 , Page(s): 6619 - 6632
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (418 KB) |  | HTML iconHTML  

    This paper considers the problem of reliable communication over discrete-time channels whose impulse responses have length L and exactly SL non-zero coefficients, and whose support and coefficients remain fixed over blocks of N >; L channel uses but change independently from block to block. Here, it is assumed that the channel's support and coefficie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concatenated Coding for the AWGN Channel With Noisy Feedback

    Publication Year: 2011 , Page(s): 6633 - 6649
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1643 KB) |  | HTML iconHTML  

    The use of open-loop coding can be easily extended to a closed-loop concatenated code if the transmitter has access to feedback. This can be done by introducing a feedback transmission scheme as an inner code. In this paper, this process is investigated for the case when a linear feedback scheme is implemented as an inner code and, in particular, over an additive white Gaussian noise (AWGN) channe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Alphabets and Binary Labelings for BICM at Low SNR

    Publication Year: 2011 , Page(s): 6650 - 6672
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (956 KB) |  | HTML iconHTML  

    Optimal binary labelings, input distributions, and input alphabets are analyzed for the so-called bit-interleaved coded modulation (BICM) capacity, paying special attention to the low signal-to-noise ratio (SNR) regime. For 8-ary pulse amplitude modulation (PAM) and for 0.75 bit/symbol, the folded binary code results in a higher capacity than the binary reflected Gray code (BRGC) and the natural b... View full abstract»

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

Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Frank R. Kschischang

Department of Electrical and Computer Engineering