# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 39

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

Publication Year: 2016, Page(s): C2
| PDF (193 KB)
• ### Coded Cooperative Data Exchange for a Secret Key

Publication Year: 2016, Page(s):3785 - 3795
Cited by:  Papers (4)
| | PDF (430 KB) | HTML

We consider a coded cooperative data exchange problem with the goal of generating a secret key. In particular, we investigate the number of public transmissions required for a set of clients to agree on a secret key with probability one, subject to the constraint that it remains private from an eavesdropper. Although the problems are closely related, we prove that secret key generation with the fe... View full abstract»

• ### Secret Key Agreement: General Capacity and Second-Order Asymptotics

Publication Year: 2016, Page(s):3796 - 3810
Cited by:  Papers (10)
| | PDF (425 KB) | HTML

We revisit the problem of secret key agreement using interactive public communication for two parties and propose a new secret key agreement protocol. The protocol attains the secret key capacity for general observations and attains the second-order asymptotic term in the maximum length of a secret key for independent and identically distributed observations. In contrast to the previously suggeste... View full abstract»

• ### On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model

Publication Year: 2016, Page(s):3811 - 3830
Cited by:  Papers (6)
| | PDF (490 KB) | HTML

The focus of this paper is on the public communication required for generating a maximal-rate secret key (SK) within the multiterminal source model of Csiszár and Narayan. Building on the prior work of Tyagi for the two-terminal scenario, we derive a lower bound on the communication complexity, RSK, defined to be the minimum rate of public communication needed to generate a maxi... View full abstract»

• ### On the Private Key Capacity of the $M$ -Relay Pairwise Independent Network

Publication Year: 2016, Page(s):3831 - 3843
Cited by:  Papers (1)
| | PDF (660 KB) | HTML

We study the problem of private key generation in a cooperative pairwise independent network (PIN), with M + 2 terminals (Alice, Bob, and M relays), M ≥ 2. In the PIN, the correlated source observed by every pair of terminals is independent of the sources observed by any other pairs of terminals. Moreover, all terminals can communicate with each other over a public channel, which is also ob... View full abstract»

• ### A Channel Under Simultaneous Jamming and Eavesdropping Attack—Correlated Random Coding Capacities Under Strong Secrecy Criteria

Publication Year: 2016, Page(s):3844 - 3862
Cited by:  Papers (8)
| | PDF (390 KB) | HTML

We give a complete characterization of the correlated random coding secrecy capacity of arbitrarily varying wiretap channels (AVWCs). We apply two alternative strong secrecy criteria, which both lead to the same multi-letter formula. The difference of these criteria lies in the treatment of correlated randomness; they coincide in the case of uncorrelated codes. On the basis of the derived formula,... View full abstract»

• ### Semantic-Security Capacity for Wiretap Channels of Type II

Publication Year: 2016, Page(s):3863 - 3879
Cited by:  Papers (11)
| | PDF (502 KB) | HTML

The secrecy capacity of the type II wiretap channel (WTC II) with a noisy main channel is currently an open problem. Herein its secrecy-capacity is derived and shown to be equal to its semantic-security (SS) capacity. In this setting, the legitimate users communicate via a discrete-memoryless (DM) channel in the presence of an eavesdropper that has perfect access to a subset of its choosing of the... View full abstract»

• ### Secure Massive MIMO Transmission With an Active Eavesdropper

Publication Year: 2016, Page(s):3880 - 3900
Cited by:  Papers (29)
| | PDF (1887 KB) | HTML

In this paper, we investigate secure and reliable transmission strategies for multi-cell multi-user massive multiple-input multiple-output systems with a multi-antenna active eavesdropper. We consider a time-division duplex system where uplink training is required and an active eavesdropper can attack the training phase to cause pilot contamination at the transmitter. This forces the precoder used... View full abstract»

• ### Communication and Randomness Lower Bounds for Secure Computation

Publication Year: 2016, Page(s):3901 - 3929
Cited by:  Papers (1)
| | PDF (1999 KB) | HTML

In secure multiparty computation (MPC), mutually distrusting users collaborate to compute a function of their private data without revealing any additional information about their data to the other users. While it is known that information theoretically secure MPC is possible among n users having access to private randomness and are pairwise connected by secure, noiseless, and bidirectional links ... View full abstract»

• ### Secure Source Coding With a Public Helper

Publication Year: 2016, Page(s):3930 - 3949
Cited by:  Papers (1)
| | PDF (1064 KB) | HTML

We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper and 2) triangular source coding with a helper where the helper is considered as a public terminal. We are interested in how the helper can support the ... View full abstract»

• ### Multiuser Random Coding Techniques for Mismatched Decoding

Publication Year: 2016, Page(s):3950 - 3970
Cited by:  Papers (3)
| | PDF (656 KB) | HTML

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent ... View full abstract»

• ### A General Formula for Compound Channel Capacity

Publication Year: 2016, Page(s):3971 - 3991
Cited by:  Papers (1)
| | PDF (484 KB) | HTML

A general formula, for the capacity of arbitrary compound channels with the receiver channel state information, is obtained using the information density approach. No assumptions of ergodicity, stationarity, or information stability are made and the channel state set is arbitrary. A direct (constructive) proof is given. To prove achievability, we generalize Feinstein Lemma to the compound channel ... View full abstract»

• ### Wasserstein Continuity of Entropy and Outer Bounds for Interference Channels

Publication Year: 2016, Page(s):3992 - 4002
Cited by:  Papers (9)
| | PDF (382 KB) | HTML

It is shown that under suitable regularity conditions, differential entropy is O(√n)-Lipschitz as a function of probability distributions on Ilin with respect to the quadratic Wasserstein distance. Under similar conditions, (discrete) Shannon entropy is shown to be O(n)-Lipschitz in distributions over the product space with respect to Ornstein's d̅-distance (Wasserstein distance corr... View full abstract»

• ### The Bethe Free Energy Allows to Compute the Conditional Entropy of Graphical Code Instances: A Proof From the Polymer Expansion

Publication Year: 2016, Page(s):4003 - 4023
| | PDF (718 KB) | HTML

The main objective of this paper is to explore the precise relationship between the Bethe free energy (or entropy) and the Shannon conditional entropy of graphical error correcting codes. The main result shows that the Bethe free energy associated with a low-density parity-check code used over a binary symmetric channel in a large noise regime is, with high probability, asymptotically exact as the... View full abstract»

• ### Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes

Publication Year: 2016, Page(s):4024 - 4038
Cited by:  Papers (1)
| | PDF (658 KB) | HTML

We propose efficient coding schemes for two communication settings: 1) asymmetric channels and 2) channels with an informed encoder. These settings are important in non-volatile memories, as well as optical and broadcast communication. The schemes are based on non-linear polar codes, and they build on and improve recent work on these settings. In asymmetric channels, we tackle the exponential stor... View full abstract»

• ### Distance Enumerator Analysis for Interleave-Division Multi-User Codes

Publication Year: 2016, Page(s):4039 - 4053
Cited by:  Papers (2)
| | PDF (1317 KB) | HTML

Consider an interleave-division multi-user coding model for a Gaussian multiple-access channel (MAC). Each user's message is encoded by a separate channel encoder followed by a user-interleaver, which is employed for user separation. All the users' codewords are jointly regarded as one multi-user codeword, and the distance between two multi-user codewords is defined as the Euclidean distance after... View full abstract»

• ### Fountain Codes With Nonuniform Selection Distributions Through Feedback

Publication Year: 2016, Page(s):4054 - 4070
Cited by:  Papers (3)
| | PDF (1887 KB) | HTML

One key requirement for fountain (rateless) coding schemes is to achieve a high intermediate symbol recovery rate. Recent coding schemes have incorporated the use of a feedback channel to improve the intermediate performance of traditional rateless codes; however, these codes with feedback are designed based on uniformly at random selection of input symbols. In this paper, on the other hand, we de... View full abstract»

• ### The Weight Hierarchy of Some Reducible Cyclic Codes

Publication Year: 2016, Page(s):4071 - 4080
| | PDF (337 KB) | HTML

The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we study the GHWs for a family of reducible cyclic codes and obtain the complete weight hierarchy in several cases. This is achieved by extending the idea of Yang e... View full abstract»

• ### On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding

Publication Year: 2016, Page(s):4081 - 4095
Cited by:  Papers (5)
| | PDF (327 KB) | HTML

Rank weights and generalized rank weights have been proved to characterize error and erasure correction, and information leakage in linear network coding, in the same way as Hamming weights and generalized Hamming weights describe classical error and erasure correction, and information leakage in wire-tap channels of type II and code-based secret sharing. Although many similarities between both th... View full abstract»

• ### Linear Network Coding, Linear Index Coding and Representable Discrete Polymatroids

Publication Year: 2016, Page(s):4096 - 4119
Cited by:  Papers (5)
| | PDF (2086 KB) | HTML

Discrete polymatroids are the multi-set analogue of matroids. In this paper, we explore the connections among linear network coding, linear index coding, and representable discrete polymatroids. We consider the vector linear solutions of networks over a field Fq, with possibly different message and edge vector dimensions, which are referred to as linear fractional solutions. It is well ... View full abstract»

• ### On the Optimality of Simple Schedules for Networks With Multiple Half-Duplex Relays

Publication Year: 2016, Page(s):4120 - 4134
Cited by:  Papers (3)
| | PDF (626 KB) | HTML

This paper studies networks that consist of N half-duplex relays assisting the communication between a source and a destination. In ISIT'12 Brahma et al. conjectured that in Gaussian half-duplex diamond networks (i.e., without a direct link between the source and the destination, and with N non-interfering relays), an approximately optimal relay scheduling policy (i.e., achieving the cut-set upper... View full abstract»

• ### On Achievable Distortion Exponents for a Gaussian Source Transmitted Over Parallel Gaussian Channels With Correlated Fading and Asymmetric SNRs

Publication Year: 2016, Page(s):4135 - 4153
| | PDF (801 KB) | HTML

This paper considers the end-to-end mean squared error distortion in reconstructing a memoryless proper-complex Gaussian source transmitted over a set of parallel block-fading Gaussian noise channels, where the fading gains are modeled as correlated Rayleigh distributed random variables with different average powers, thus resulting in asymmetric average received signal noise ratios (SNRs). The dis... View full abstract»

• ### Achieving Full DoF in Heterogeneous Parallel Broadcast Channels With Outdated CSIT

Publication Year: 2016, Page(s):4154 - 4171
Cited by:  Papers (2)
| | PDF (1608 KB) | HTML

We consider communication over heterogeneous parallel channels, where a transmitter is connected to two users via two parallel channels: a multiple-input multiple-output (MIMO) broadcast channel (BC) and a noiseless rate-limited multicast channel. We characterize the optimal degrees of freedom (DoF) region of this setting when the transmitter has delayed channel state information (CSIT) regarding ... View full abstract»

• ### Degrees of Freedom in Vector Interference Channels

Publication Year: 2016, Page(s):4172 - 4197
Cited by:  Papers (5)
| | PDF (511 KB) | HTML

This paper continues the Wu-Shamai-Verdú program on characterizing the degrees of freedom (DoF) of interference channels (ICs) through Rényi information dimension. Specifically, we find a single-letter formula for the DoF of vector ICs, encompassing multiple-input multiple-output ICs, time- and/or frequency-selective ICs, and combinations thereof, as well as scalar ICs as considere... 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