# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 44

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

Publication Year: 2014, Page(s): C2
| PDF (142 KB)
• ### Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels

Publication Year: 2014, Page(s):7389 - 7415
Cited by:  Papers (31)
| | PDF (850 KB) | HTML

Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now termed threshold saturation via spatial coupling. Spatially-coupled codes have been successfully applied in numerous areas. In particular, it was proven that spatia... View full abstract»

• ### Error Floor Approximation for LDPC Codes in the AWGN Channel

Publication Year: 2014, Page(s):7416 - 7441
Cited by:  Papers (19)
| | PDF (3832 KB) | HTML

This paper addresses the prediction of error floors of low-density parity-check codes transmitted over the additive white Gaussian noise channel. Using a linear state-space model to estimate the behavior of the sum-product algorithm (SPA) decoder in the vicinity of trapping sets (TSs), we study the performance of the SPA decoder in the log-likelihood ratio (LLR) domain as a function of the LLR sat... View full abstract»

• ### Energy-Minimizing Error-Correcting Codes

Publication Year: 2014, Page(s):7442 - 7450
Cited by:  Papers (5)
| | PDF (653 KB) | HTML

We study a discrete model of repelling particles, and we show using linear programming bounds that many familiar families of error-correcting codes minimize a broad class of potential energies when compared with all other codes of the same size and block length. Examples of these universally optimal codes include Hamming, Golay, and Reed-Solomon codes, among many others, and this helps to explain ... View full abstract»

• ### Prefactor Reduction of the Guruswami–Sudan Interpolation Step

Publication Year: 2014, Page(s):7451 - 7463
Cited by:  Papers (2)
| | PDF (1180 KB) | HTML

The most computationally intensive step of the Guruswami-Sudan list decoder for generalized Reed-Solomon codes is the formation of a bivariate interpolation polynomial. Complexity can be reduced if this polynomial has prefactors, i.e., factors of its univariate constituent polynomials that are independent of the received vector, and hence known a priori. For example, the well-known re-encoding pro... View full abstract»

• ### Syndrome Generation and Error Location Search for the Decoding of Algebraic-Geometry Codes on Plane Garcia–Stichtenoth Curves

Publication Year: 2014, Page(s):7464 - 7472
| | PDF (558 KB) | HTML

In this paper, the basic function field of an asymptotically optimal tower of function fields by Garcia and Stichtenoth is studied, where bases of one-point linear systems can be explicitly constructed. A representation of finite GF(q2)-rational points on the associated plane curve is derived in this paper. This representation is exploited to extend the use of Horner's loops and the mec... View full abstract»

• ### On Zero-Delay Source-Channel Coding

Publication Year: 2014, Page(s):7473 - 7489
Cited by:  Papers (25)
| | PDF (904 KB) | HTML

This paper studies the zero-delay source-channel coding problem, and specifically the problem of obtaining the vector transformations that optimally map between the m-dimensional source space and k-dimensional channel space, under a given transmission power constraint and for the mean square error distortion. The functional properties of the cost are studied and the necessary conditions for the op... View full abstract»

• ### On Two-Stage Sequential Coding of Correlated Sources

Publication Year: 2014, Page(s):7490 - 7505
| | PDF (522 KB) | HTML

We study the problem of two-stage sequential coding (TSSC), which is an extension of sequential coding of correlated sources. Let X and Y be dependent random variables. The network contains two encoders and two decoders: 1) a Y encoder with input Y; 2) an X encoder with inputs X and Y; 3) a Y decoder that reconstructs Y; and 4) an X decoder that reconstructs X. The first stage is traditional seque... View full abstract»

• ### Indirect and Direct Gaussian Distributed Source Coding Problems

Publication Year: 2014, Page(s):7506 - 7539
Cited by:  Papers (7)
| | PDF (1168 KB) | HTML

We consider the distributed source coding system of L correlated Gaussian sources Yl, l = 1, 2, ... , L, which are noisy observations of correlated Gaussian remote sources Xk, k = 1,2, ..., K. We assume that YL= t(Y1, Y2,...,YL) is an observation of the source vector XK= t(X1, X2, . . . , XK View full abstract»

• ### Rate-Distortion Bounds for Wyner–Ziv Coding With Gaussian Scale Mixture Correlation Noise

Publication Year: 2014, Page(s):7540 - 7546
| | PDF (585 KB) | HTML

The objective of this paper is the characterization of the Wyner-Ziv rate-distortion function for memoryless continuous sources, when the correlation between the sources is modeled via an additive noise channel. Modeling the distribution of the correlation noise via a Gaussian mixture, with discrete or continuous mixing variable, provides a unified signal model able to describe a wide class of dis... View full abstract»

• ### A Lower Bound on the Sum Rate of Multiple Description Coding With Symmetric Distortion Constraints

Publication Year: 2014, Page(s):7547 - 7567
Cited by:  Papers (10)
| | PDF (549 KB) | HTML

We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the erasure distortion measure or Hamming distortion measure, this lower bound can be evaluated with the aid of certain minimax theorems. A similar minimax theorem is established in the quadratic Gaussian setting, which is further le... View full abstract»

• ### Universal Wyner–Ziv Coding for Distortion Constrained General Side Information

Publication Year: 2014, Page(s):7568 - 7583
Cited by:  Papers (1)
| | PDF (562 KB) | HTML

We investigate the Wyner-Ziv coding in which the statistics of the principal source is known but the statistics of the channel generating the side information is unknown except that it is in a certain class. The class consists of channels such that the distortion between the principal source and side information is smaller than a threshold, but channels may be neither stationary nor ergodic. In th... View full abstract»

• ### Rate-Distortion Theory for Secrecy Systems

Publication Year: 2014, Page(s):7584 - 7605
Cited by:  Papers (34)
| | PDF (1172 KB) | HTML

Secrecy in communication systems is measured herein by the distortion that an adversary incurs. The transmitter and receiver share secret key, which they use to encrypt communication and ensure distortion at an adversary. A model is considered in which an adversary not only intercepts the communication from the transmitter to the receiver, but also potentially has side information. In particular, ... View full abstract»

• ### Exact Correct-Decoding Exponent of the Wiretap Channel Decoder

Publication Year: 2014, Page(s):7606 - 7615
Cited by:  Papers (3)
| | PDF (301 KB) | HTML

The performance of the achievability scheme for Wyner's wiretap channel model is examined from the perspective of the probability of correct decoding, P<sub>c</sub>, at the wiretap channel decoder. In particular, for finite-alphabet memoryless channels, the exact random coding exponent of P<sub>c</sub> is derived as a function of the total coding rate R<sub>1</sub&... View full abstract»

• ### Information Measures: The Curious Case of the Binary Alphabet

Publication Year: 2014, Page(s):7616 - 7626
Cited by:  Papers (8)
| | PDF (249 KB) | HTML

Four problems related to information divergence measures defined on finite alphabets are considered. In three of the cases we consider, we illustrate a contrast that arises between the binary-alphabet and larger alphabet settings. This is surprising in some instances, since characterizations for the larger alphabet settings do not generalize their binary-alphabet counterparts. In particular, we sh... View full abstract»

• ### Feedback, Cribbing, and Causal State Information on the Multiple-Access Channel

Publication Year: 2014, Page(s):7627 - 7654
Cited by:  Papers (3)
| | PDF (713 KB) | HTML

The benefits afforded by feedback and/or causal state information (SI) on the state-dependent discrete memoryless multiple-access channel (SD-MAC) with cribbing encoder/s are studied. Capacity regions are derived for communication scenarios whose capacities without cribbing are still unknown. It is shown that when the encoders can crib, the SD-MAC behaves less like a MAC and more like a single-use... View full abstract»

• ### Peak-to-Average Power Ratio of Good Codes for Gaussian Channel

Publication Year: 2014, Page(s):7655 - 7660
Cited by:  Papers (3)
| | PDF (199 KB) | HTML

Consider a problem of forward error-correction for the additive white Gaussian noise (AWGN) channel. For finite blocklength codes, the backoff from the channel capacity is inversely proportional to the square root of the blocklength. In this paper, it is shown that the codes achieving this tradeoff must necessarily have peak-to-average power ratio (PAPR) proportional to logarithm of the blocklengt... View full abstract»

Publication Year: 2014, Page(s):7661 - 7685
Cited by:  Papers (59)
| | PDF (1586 KB) | HTML

Linear receivers are often used to reduce the implementation complexity of multiple-antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be decoded individually. Although easy to implement, this approach can be highly suboptimal when the channel matrix is near singular. This paper d... View full abstract»

• ### Energy and Sampling Constrained Asynchronous Communication

Publication Year: 2014, Page(s):7686 - 7697
Cited by:  Papers (7)
| | PDF (400 KB) | HTML

The minimum energy, and, more generally, the minimum cost, to transmit 1 bit of information was recently derived for bursty communication when the information is available infrequently at random times at the transmitter. This result assumes that the receiver is always in the listening mode and samples all channel outputs until it makes a decision. Since sampling is in practice one of the receiver'... View full abstract»

• ### Cognitive Interference Channels With Confidential Messages Under Randomness Constraint

Publication Year: 2014, Page(s):7698 - 7707
Cited by:  Papers (2)
| | PDF (289 KB) | HTML

The cognitive interference channel with confidential messages (CICC) proposed by Liang <italic>et al.</italic> is investigated. When the security is considered in coding systems, it is well-known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be leaked to an eavesdropper. For the CICC, the tradeoff between the r... View full abstract»

• ### Achieving the Capacity of the$N$-Relay Gaussian Diamond Network Within log$N$Bits

Publication Year: 2014, Page(s):7708 - 7718
Cited by:  Papers (8)
| | PDF (1294 KB) | HTML

We consider the$N$-relay Gaussian diamond network where a source node communicates to a destination node via$N$parallel relays through a cascade of a Gaussian broadcast (BC) and a multiple access (MAC) channel. Introduced in 2000 by Schein and Gallager, the ... View full abstract»

• ### Energy-Efficient Communication Over the Unsynchronized Gaussian Diamond Network

Publication Year: 2014, Page(s):7719 - 7731
| | PDF (464 KB) | HTML

Communication networks are often designed and analyzed assuming tight synchronization among nodes. However, in applications that require communication in the energy-efficient regime of low signal-to-noise ratios, establishing tight synchronization among nodes in the network can result in a significant energy overhead. Motivated by a recent result showing that near-optimal energy efficiency can be ... View full abstract»

• ### On the Capacity of Multiple-Access-Z-Interference Channels

Publication Year: 2014, Page(s):7732 - 7750
Cited by:  Papers (1)
| | PDF (690 KB) | HTML

The capacity of a network in which a multiple access channel generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference cas... View full abstract»

• ### The Degrees of Freedom Region of the$2 \times 2 \times 2$MIMO Interference Network

Publication Year: 2014, Page(s):7751 - 7759
Cited by:  Papers (2)
| | PDF (975 KB) | HTML

The layered two-hop, two-unicast multi-input, multi-output (MIMO) interference network consists of two transmitters, two relays, and two receivers with the first and the second hop networks between transmitters and relays, and between relays and receivers, respectively, both being Gaussian MIMO interference channels. The degrees of freedom (DoF) region is established in the general case in which t... 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