# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 44

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

Publication Year: 2016, Page(s): C2
| PDF (117 KB)
• ### Duality of a Source Coding Problem and the Semi-Deterministic Broadcast Channel With Rate-Limited Cooperation

Publication Year: 2016, Page(s):2285 - 2307
Cited by:  Papers (5)
| | PDF (1214 KB) | HTML

The Wyner-Ahlswede-Körner (WAK) empirical-coordination problem where the encoders cooperate via a finite-capacity one-sided link is considered. The coordination-capacity region is derived by combining several source coding techniques, such as Wyner-Ziv coding, binning, and superposition coding. Furthermore, a semi-deterministic (SD) broadcast channel (BC) with one-sided decoder cooperation... View full abstract»

Publication Year: 2016, Page(s):2308 - 2323
Cited by:  Papers (3)
| | PDF (1227 KB) | HTML

In this paper, we investigate problems of communication over physically degraded, state-dependent broadcast channels (BCs) with cooperating decoders. Two different setups are considered, and their capacity regions are characterized. First, we study a setting in which one decoder can use a finite capacity link to send the other decoder information regarding the messages or the channel states. In th... View full abstract»

• ### Bayesian $M$ -Ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds Are Tight

Publication Year: 2016, Page(s):2324 - 2333
Cited by:  Papers (2)
| | PDF (426 KB) | HTML

Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the tightness of the meta-converse bound by Polyanskiy et al.; the second expression is a function of an information-spectrum measure and implies the tightness of a gener... View full abstract»

• ### Covert Communication Over Noisy Channels: A Resolvability Perspective

Publication Year: 2016, Page(s):2334 - 2354
Cited by:  Papers (18)
| | PDF (1072 KB) | HTML

We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel, while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals through another discrete memoryless channel. We develop a coding scheme based on the principle of channel resolvability, which generalizes and extends prior wo... View full abstract»

• ### Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages

Publication Year: 2016, Page(s):2355 - 2409
Cited by:  Papers (11)
| | PDF (1290 KB) | HTML

The secure multiplex coding (SMC) is a technique to remove rate loss in the coding for wire-tap channels and broadcast channels with confidential messages caused by the inclusion of random bits into transmitted signals. SMC replaces the random bits by other meaningful secret messages, and a collection of secret messages serves as the random bits to hide the rest of messages. In the previous studie... View full abstract»

• ### Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy

Publication Year: 2016, Page(s):2410 - 2429
Cited by:  Papers (5)
| | PDF (1125 KB) | HTML

We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints. Our scheme extends previous work by using an optimal rate of uniform randomness in the stochastic encoder, and avoiding assumptions regarding the symmetry or degraded nature of the channels. The price paid for these extensions is ... View full abstract»

• ### An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

Publication Year: 2016, Page(s):2430 - 2480
| | PDF (1131 KB) | HTML

This paper presents exact capacity characterizations for the case, when a principal, Alice, wants to securely send a message to another principal, Bob, over three network configurations: the parallel edges network, the V-network, and the triangle network. We assume that: 1) a passive eavesdropper, Eve, overhears any one edge in the network; 2) each edge corresponds to an independent broadcast pack... View full abstract»

• ### A Numerical Study on the Wiretap Network With a Simple Network Topology

Publication Year: 2016, Page(s):2481 - 2492
Cited by:  Papers (1)
| | PDF (561 KB) | HTML

In this paper, we study a security problem on a simple wiretap network, consisting of a source node S, a destination node D, and an intermediate node R. The intermediate node connects the source and the destination nodes via a set of noiseless parallel channels, with sizes n1 and n2, respectively. A message M is to be sent from S to D. The information in the network may be ea... View full abstract»

• ### Linear Network Coding for Erasure Broadcast Channel With Feedback: Complexity and Algorithms

Publication Year: 2016, Page(s):2493 - 2503
Cited by:  Papers (2)
| | PDF (271 KB) | HTML

This paper investigates the linear network coding problem for erasure broadcast channel with user feedback. An innovative linear network code is shown to be uniformly optimal for the system. In general, determining the existence of innovative packets is proved to be NP-complete. When the finite field size is larger than the number of users, innovative packets always exist and the problem of findin... View full abstract»

• ### Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability

Publication Year: 2016, Page(s):2504 - 2519
Cited by:  Papers (4)
| | PDF (700 KB) | HTML

Linear network coding transmits data through networks by letting the intermediate nodes combine the messages they receive and forward the combinations toward their destinations. The solvability problem asks whether the demands of all the destinations can be simultaneously satisfied by using linear network coding. The guessing number approach converts this problem into determining the number of fix... View full abstract»

• ### On the Subtleties of $q$ -PAM Linear Physical-Layer Network Coding

Publication Year: 2016, Page(s):2520 - 2544
Cited by:  Papers (6)
| | PDF (2403 KB) | HTML

This paper investigates various subtleties of applying linear physical-layer network coding (PNC) with q-level pulse amplitude modulation (q-PAM) in two-way relay channels. A critical issue is how the PNC system performs when the received powers from the two users at the relay are imbalanced. In particular, how would the PNC system perform under slight power imbalance that is inevitable in practic... View full abstract»

• ### Near-Optimal Modulo-and-Forward Scheme for the Untrusted Relay Channel

Publication Year: 2016, Page(s):2545 - 2556
Cited by:  Papers (6)
| | PDF (991 KB) | HTML

This paper studies an untrusted relay channel, in which the destination sends artificial noise simultaneously with the source sending a message to the relay, in order to protect the source's confidential message. The traditional amplify-and-forward (AF) scheme shows poor performance in this situation because of the interference power dilemma. Providing better security by using stronger artificial ... View full abstract»

• ### On the Complexity of Scheduling in Half-Duplex Diamond Networks

Publication Year: 2016, Page(s):2557 - 2572
Cited by:  Papers (2)
| | PDF (1474 KB) | HTML

We consider an n-relay Gaussian diamond network where a source communicates to a destination with the help of n half-duplex relays. Achieving rates close to the capacity of this network requires to employ all the n relays under an optimal transmit/receive schedule. Even for the moderate values of n, this can have significant operational complexity as the optimal schedule may possibly have 2n<... View full abstract»

• ### Signaling Over Two-User Parallel Gaussian Interference Channels: Outage Analysis

Publication Year: 2016, Page(s):2573 - 2591
Cited by:  Papers (1)
| | PDF (840 KB) | HTML

This paper presents an outage analysis for a two-user parallel Gaussian interference channel consisting of two sub-channels. Each sub-channel is modeled as a two-user Gaussian interference channel with quasi-static and flat fading. Both users employ single-layer Gaussian code-books and maintain a statistical correlation ρ between the signals transmitted over the underlying sub-channels. Whe... View full abstract»

• ### The Approximate Capacity Region of the Symmetric $K$ -User Gaussian Interference Channel With Strong Interference

Publication Year: 2016, Page(s):2592 - 2621
Cited by:  Papers (1)
| | PDF (2277 KB) | HTML

The symmetric K-user interference channel (IC) is studied with the goal of characterizing its capacity region in the strong interference regime within a constant gap. The achievable rate region of a scheme combining rate splitting at the transmitters and interference alignment and successive decoding/computation at the receivers is derived. Next, it is shown that this scheme achieves the so-called... View full abstract»

• ### Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel

Publication Year: 2016, Page(s):2622 - 2638
Cited by:  Papers (4)
| | PDF (539 KB) | HTML

We analyze the asymptotic performance of nonbinary spatially coupled low-density parity-check (SC-LDPC) code ensembles defined over the general linear group on the binary erasure channel. In particular, we prove the threshold saturation of belief propagation decoding to the so-called potential threshold, using the proof technique based on potential functions introduced by Yedla et al., assuming th... View full abstract»

• ### Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes

Publication Year: 2016, Page(s):2639 - 2657
Cited by:  Papers (1)
| | PDF (752 KB) | HTML

We consider low-density parity-check (LDPC) code ensembles over non-binary Galois fields when used for transmission over arbitrary discrete memoryless channels. Belief propagation decoding for these codes has been shown to achieve excellent results. However, computing the decoding threshold using density evolution is usually impractical, since one needs to propagate multi-dimensional probability d... View full abstract»

• ### Iterative Decoding of LDPC Codes Over the $q$ -Ary Partial Erasure Channel

Publication Year: 2016, Page(s):2658 - 2672
Cited by:  Papers (5)
| | PDF (1339 KB) | HTML

In this paper, we develop a new channel model, which we name the q-ary partial erasure channel (QPEC). The QPEC has a q-ary input, and its output is either the input symbol or a set of M (2 ≤ M ≤ q) symbols, containing the input symbol. This channel serves as a generalization to the binary erasure channel and mimics situations when a symbol output from the channel is known only parti... View full abstract»

• ### Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols

Publication Year: 2016, Page(s):2673 - 2681
Cited by:  Papers (3)
| | PDF (272 KB) | HTML

Partial MDS (PMDS) codes are erasure codes combining local (row) correction with global additional correction of entries, while sector-disk (SD) codes are erasure codes that address the mixed failure mode of current redundant arrays of independent disk (RAID) systems. It has been an open problem to construct general codes that have the PMDS and the SD properties, and previous work has relied on Mo... View full abstract»

• ### New Multiple Insertion/Deletion Correcting Codes for Non-Binary Alphabets

Publication Year: 2016, Page(s):2682 - 2693
Cited by:  Papers (1)
| | PDF (1161 KB) | HTML

We generalize Helberg's number-theoretic construction of binary multiple insertion/deletion correcting codes to non-binary alphabets and describe a linear decoding algorithm for correcting multiple deletions. View full abstract»

• ### On the Covering Dimension of a Linear Code

Publication Year: 2016, Page(s):2694 - 2701
Cited by:  Papers (1)
| | PDF (204 KB) | HTML

This paper introduces the covering dimension of a linear code over a finite field, which is analogous to the critical exponent of a representable matroid and, thus, generalizes invariants that lie at the heart of several fundamental problems in a coding theory. An upper bound on the covering dimension is proved, improving Kung's classical bound for the critical exponent. In addition, a constructio... View full abstract»

• ### A New Perspective of Cyclicity in Convolutional Codes

Publication Year: 2016, Page(s):2702 - 2706
Cited by:  Papers (4)
| | PDF (277 KB) | HTML

In this paper, we propose a new way of providing cyclic structures to convolutional codes. We define the skew cyclic convolutional codes as left ideals of a quotient ring of a suitable non-commutative polynomial ring. In contrast to the previous approaches to cyclicity for convolutional codes, we use Ore polynomials with coefficients in a field (the rational function field over a finite field), so... View full abstract»

• ### Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs

Publication Year: 2016, Page(s):2707 - 2718
Cited by:  Papers (3)
| | PDF (531 KB) | HTML

We construct an explicit family of Fh-linear rankmetric codes over any field Fh that enables efficient list-decoding up to a fraction p of errors in the rank metric with a rate of 1 - ρ - e, for any desired ρ ∈ (0, 1) and e > 0. This is the first explicit construction of positive rate rank-metric codes for efficient list-decoding beyond the unique decoding radius. Our codes... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu