# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 57

Publication Year: 2012, Page(s):C1 - C4
| PDF (49 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2012, Page(s): C2
| PDF (42 KB)
• ### On Generic Erasure Correcting Sets and Related Problems

Publication Year: 2012, Page(s):501 - 508
Cited by:  Papers (3)
| | PDF (231 KB) | HTML

Motivated by iterative decoding techniques for the binary erasure channel Hollmann and Tolhuizen introduced and studied the notion of generic erasure correcting sets for linear codes. A generic (r,s)-erasure correcting set generates for all codes of codimension r a parity check matrix that allows iterative decoding of all correctable erasure patterns of size s or less. ... View full abstract»

• ### Analog Product Codes Decodable by Linear Programming

Publication Year: 2012, Page(s):509 - 518
Cited by:  Papers (3)
| | PDF (1995 KB) | HTML

In this paper, we present a new analog error correcting coding scheme for real valued signals that are corrupted by impulsive noise. This product code improves Donoho's deterministic construction by using a probabilistic approach. More specifically, our construction corrects more errors than the Donoho matrices by allowing a vanishingly small probability of error (with the increase in block size).... View full abstract»

• ### Novel Burst Error Correction Algorithms for Reed-Solomon Codes

Publication Year: 2012, Page(s):519 - 529
Cited by:  Papers (5)
| | PDF (3461 KB) | HTML

In this paper, we present three novel burst error correcting algorithms for an (n, k) Reed-Solomon code. The algorithmic complexities are of the same order as error-and-erasure decoding, O(rn), where r=n-k. In particular, their hardware implementation shares elements of Blahut error-and-erasure decoding. In contrast, all existing single-burst error ... View full abstract»

• ### Rateless Coding for Gaussian Channels

Publication Year: 2012, Page(s):530 - 547
Cited by:  Papers (45)  |  Patents (3)
| | PDF (548 KB) | HTML

A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity-achieving. We show by construction that perfect rateless codes with low-complexity decoding algorithms exist for additive white Gaussian noise channel... View full abstract»

• ### Variable Length Unordered Codes

Publication Year: 2012, Page(s):548 - 569
Cited by:  Papers (6)
| | PDF (602 KB) | HTML

In an unordered code, no code word is contained in any other code word. Unordered codes are all unidirectional error detecting (AUED) codes. In the binary case, it is well known that among all systematic codes with k information bits, Berger codes are optimal unordered codes with r=[log2(k+1)] ≅ log2k check bits. This paper gives some new th... View full abstract»

• ### Bounding the Coding Advantage of Combination Network Coding in Undirected Networks

Publication Year: 2012, Page(s):570 - 584
Cited by:  Papers (22)
| | PDF (448 KB) | HTML

We refer to network coding schemes in which information flows propagate along a combination network topology as combination network coding (CNC). CNC and its variations are the first network coding schemes studied in the literature, and so far still represent arguably the most important class of known structures where network coding is nontrivial. Our main goal in this paper is to seek a thorough ... View full abstract»

• ### Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds

Publication Year: 2012, Page(s):585 - 607
Cited by:  Papers (48)
| | PDF (5538 KB) | HTML

Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph structure parameters (like variable degrees, check node degrees, girth) of the Tanner graph and of the underlying proto-graph. Moreover, for several ... View full abstract»

• ### Evaluation of Marton's Inner Bound for the General Broadcast Channel

Publication Year: 2012, Page(s):608 - 619
Cited by:  Papers (17)
| | PDF (5785 KB) | HTML

The best known inner bound on the two-receiver general broadcast channel is due to Marton. However this region is not computable (except in certain special cases) as no bounds on the cardinality of its auxiliary random variables exist. Nor is it even clear that the inner bound is a closed set. The main obstacle in proving cardinality bounds is the fact that the traditional use of the Carathe0... View full abstract»

• ### Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments

Publication Year: 2012, Page(s):620 - 638
Cited by:  Papers (22)
| | PDF (782 KB) | HTML

Information theory traditionally deals with “conventional data,” be it textual data, image, or video data. However, databases of various sorts have come into existence in recent years for storing “unconventional data” including biological data, social data, web data, topographical maps, and medical data. In compressing such data, one must consider two types of informati... View full abstract»

• ### Secret Key and Private Key Constructions for Simple Multiterminal Source Models

Publication Year: 2012, Page(s):639 - 651
Cited by:  Papers (23)
| | PDF (344 KB) | HTML

We propose an approach for constructing secret and private keys based on the long-known Slepian-Wolf code, due to Wyner, for correlated sources connected by a virtual additive noise channel. Our work is motivated by results of Csiszár and Narayan which highlight innate connections between secrecy generation by multiple terminals that observe correlated source signals and Slepian-Wolf near-... View full abstract»

• ### Secret-Key Generation Using Correlated Sources and Channels

Publication Year: 2012, Page(s):652 - 670
Cited by:  Papers (26)
| | PDF (731 KB) | HTML

We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel ... View full abstract»

• ### Construction of Codes for the Wiretap Channel and the Secret Key Agreement From Correlated Source Outputs Based on the Hash Property

Publication Year: 2012, Page(s):671 - 692
Cited by:  Papers (6)
| | PDF (8303 KB) | HTML

The aim of this paper is to prove coding theorems for the wiretap channel and the secret key agreement based on the the notion of a hash property for an ensemble of functions. These theorems imply that codes using sparse matrices can achieve the optimal rate. Furthermore, fixed-rate universal coding theorems for a wiretap channel and a secret key agreement are also proved. View full abstract»

• ### The Sum-Rate Bound for a New Class of Quadratic Gaussian Multiterminal Source Coding Problems

Publication Year: 2012, Page(s):693 - 707
Cited by:  Papers (5)
| | PDF (437 KB) | HTML

In this paper, we show tightness of the Berger-Tung (BT) sum-rate bound for a new class of quadratic Gaussian multiterminal (MT) source coding problems dubbed bi-eigen equal-variance with equal distortion (BEEV-ED), where the L × L source covariance matrix has equal diagonal elements with two distinct eigenvalues, and the L target distortions are equal. Let K ( View full abstract»

• ### $f$ -Divergence Estimation and Two-Sample Homogeneity Test Under Semiparametric Density-Ratio Models

Publication Year: 2012, Page(s):708 - 720
Cited by:  Papers (14)
| | PDF (511 KB) | HTML

A density ratio is defined by the ratio of two probability densities. We study the inference problem of density ratios and apply a semiparametric density-ratio estimator to the two-sample homogeneity test. In the proposed test procedure, the f-divergence between two probability densities is estimated using a density-ratio estimator. The f -divergence estimator is then exploited for t... View full abstract»

• ### A Coordinate System for Gaussian Networks

Publication Year: 2012, Page(s):721 - 733
Cited by:  Papers (18)
| | PDF (2817 KB) | HTML

This paper investigates network information theory problems where the external noise is Gaussian distributed. In particular, the Gaussian broadcast channel with coherent fading and the Gaussian interference channel are considered. It is shown that in these problems, non-Gaussian code ensembles can achieve higher rates than the Gaussian ones. It is also shown that the strong Shamai-Laroia conjectur... View full abstract»

• ### Codes Over Matrix Rings for Space-Time Coded Modulations

Publication Year: 2012, Page(s):734 - 746
Cited by:  Papers (2)
| | PDF (305 KB) | HTML

It is known that, for transmission over quasi-static MIMO fading channels with n transmit antennas, diversity can be obtained by using an inner fully diverse space-time block code while coding gain, derived from the determinant criterion, comes from an appropriate outer code. When the inner code has a cyclic algebra structure over a number field, as for perfect space-time codes, an outer code can ... View full abstract»

• ### Two Designs of Space-Time Block Codes Achieving Full Diversity With Partial Interference Cancellation Group Decoding

Publication Year: 2012, Page(s):747 - 764
Cited by:  Papers (29)
| | PDF (4226 KB) | HTML

A partial interference cancellation (PIC) group decoding based space-time block code (STBC) design criterion was recently proposed by Guo and Xia, where the decoding complexity and the code rate traeoff is dealt when the full diversity is achieved. In this paper, two designs of STBC are proposed for any number of transmit antennas that can obtain full diversity when a PIC group decoding (with a pa... View full abstract»

• ### MIMO ARQ With Multibit Feedback: Outage Analysis

Publication Year: 2012, Page(s):765 - 779
Cited by:  Papers (23)
| | PDF (1128 KB) | HTML

This paper studies the asymptotic outage performance of incremental redundancy automatic-repeat-request (INR-ARQ) transmission over multiple-input multiple-output (MIMO) block-fading channels with discrete input constellations. We first show that transmission with random codes using a discrete signal constellation across all transmit antennas achieves the optimal outage diversity given by the Sing... View full abstract»

• ### Transmission Capacity of Ad-hoc Networks With Multiple Antennas Using Transmit Stream Adaptation and Interference Cancellation

Publication Year: 2012, Page(s):780 - 792
Cited by:  Papers (49)
| | PDF (3438 KB) | HTML

The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Assuming that the transmitter locations are distributed as a Poisson point process, this paper derives upper and lower bounds on the transmission capacity of an ad-hoc network when each node is equipped with multip... View full abstract»

• ### Multihop Analog Network Coding via Amplify-and-Forward: The High SNR Regime

Publication Year: 2012, Page(s):793 - 803
Cited by:  Papers (19)
| | PDF (509 KB) | HTML

In the simplest relaying strategy, a network node amplifies and forwards a received signal over a wireless channel. Multihop amplify-and-forward allows for a (noisy) linear combination of signals simultaneously sent from multiple sources to be propagated through the network over multiple layers of relays. The performance of multihop amplify-and-forward is limited by noise propagated to the destina... View full abstract»

• ### DMT of Multihop Networks: End Points and Computational Tools

Publication Year: 2012, Page(s):804 - 819
Cited by:  Papers (6)
| | PDF (371 KB) | HTML

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, ... View full abstract»

• ### Inner and Outer Bounds for the Gaussian Cognitive Interference Channel and New Capacity Results

Publication Year: 2012, Page(s):820 - 848
Cited by:  Papers (53)
| | PDF (6588 KB) | HTML

The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter regimes but remains unknown in general. This paper provides a comparative overview of this channel model as it proceeds through the following contributions. Firs... View full abstract»

• ### On Degrees of Freedom Region of MIMO Networks Without Channel State Information at Transmitters

Publication Year: 2012, Page(s):849 - 857
Cited by:  Papers (90)
| | PDF (290 KB) | HTML

We study the effect of the absence of channel knowledge at the transmitters for multiple-input-multiple-output (MIMO) networks. Specifically, we assume perfect channel state information at the receivers, no channel state information at the transmitter(s), and independent identically distributed (i.i.d.) Rayleigh fading across antennas, users and time slots. We provide the characterization of the d... View full abstract»

## 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
Prakash Narayan

Department of Electrical and Computer Engineering