By Topic

# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 42

Publication Year: 2013, Page(s): C1
| PDF (165 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2013, Page(s): C2
| PDF (143 KB)
• ### MMSE of “Bad” Codes

Publication Year: 2013, Page(s):733 - 743
Cited by:  Papers (8)
| | PDF (2402 KB) | HTML

We examine codes, over the additive Gaussian noise channel, designed for reliable communication at some specific signal-to-noise ratio (SNR) and constrained by the permitted minimum mean-square error (MMSE) at lower SNRs. The maximum possible rate is below point-to-point capacity, and hence, these are nonoptimal codes (alternatively referred to as “bad” codes). We show that the maxim... View full abstract»

• ### Converse Coding Theorems for Identification via Channels

Publication Year: 2013, Page(s):744 - 759
Cited by:  Papers (2)
| | PDF (6110 KB) | HTML

In identification via channels, the sum of two types of error probabilities of identification goes to one as the block length of transmission tends to infinity at rates above capacity when channels satisfy some stochastic properties. This is well known as a strong converse theorem for the identification via channels. In this paper, we prove that the sum of two error probabilities tends to one expo... View full abstract»

• ### Computable Bounds for Rate Distortion With Feed Forward for Stationary and Ergodic Sources

Publication Year: 2013, Page(s):760 - 781
Cited by:  Papers (7)
| | PDF (6653 KB) | HTML

In this paper, we consider the rate distortion problem of discrete-time, ergodic, and stationary sources with feed forward at the receiver. We derive a sequence of achievable and computable rates that converge to the feed-forward rate distortion. We show that for ergodic and stationary sources, the rate Rn(D) = 1/n min IX̂n → Xn) is achievable for any... View full abstract»

• ### Classification of Homogeneous Data With Large Alphabets

Publication Year: 2013, Page(s):782 - 795
Cited by:  Papers (8)
| | PDF (4058 KB) | HTML

Given training sequences generated by two distinct, but unknown, distributions on a common alphabet, we study the problem of determining whether a third sequence was generated according to the first or second distribution. To model sources such as natural language, for which the underlying distributions are difficult to learn from realistic amounts of data, we allow the alphabet size to grow and t... View full abstract»

• ### Guesswork, Large Deviations, and Shannon Entropy

Publication Year: 2013, Page(s):796 - 802
Cited by:  Papers (8)
| | PDF (1655 KB) | HTML

How hard is it to guess a password? Massey showed that a simple function of the Shannon entropy of the distribution from which the password is selected is a lower bound on the expected number of guesses, but one which is not tight in general. In a series of subsequent papers under ever less restrictive stochastic assumptions, an asymptotic relationship as password length grows between scaled momen... View full abstract»

• ### Entropic Inequalities and Marginal Problems

Publication Year: 2013, Page(s):803 - 817
Cited by:  Papers (26)
| | PDF (2482 KB) | HTML

A marginal problem asks whether a given family of marginal distributions for some set of random variables arises from some joint distribution of these variables. Here, we point out that the existence of such a joint distribution imposes nontrivial conditions already on the level of Shannon entropies of the given marginals. These entropic inequalities are necessary (but not sufficient) criteria for... View full abstract»

• ### On MMSE Crossing Properties and Implications in Parallel Vector Gaussian Channels

Publication Year: 2013, Page(s):818 - 844
Cited by:  Papers (9)
| | PDF (10379 KB) | HTML

The scalar additive Gaussian noise channel has the “single crossing point” property between the minimum mean square error (MMSE) in the estimation of the input given the channel output, assuming a Gaussian input to the channel, and the MMSE assuming an arbitrary input. This paper extends the result to the parallel vector additive Gaussian channel in three phases. The channel matrix i... View full abstract»

• ### The Approximate Capacity of the Gaussian n-Relay Diamond Network

Publication Year: 2013, Page(s):845 - 859
Cited by:  Papers (17)
| | PDF (4058 KB) | HTML

We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approxima... View full abstract»

• ### Half-Duplex Relaying Over Slow Fading Channels Based on Quantize-and-Forward

Publication Year: 2013, Page(s):860 - 872
Cited by:  Papers (8)
| | PDF (2810 KB) | HTML

The focus of this paper is to study the performance of the quantize-and-forward (QF) scheme over a half-duplex relay channel that is slowly fading, with the assumption that the channel state information (CSI) is available only at the receiver side. In order to do so, three steps are taken. The first step is to characterize the achievable rate of the QF scheme over a discrete memoryless half-duplex... View full abstract»

• ### Effective Capacity of Two-Hop Wireless Communication Systems

Publication Year: 2013, Page(s):873 - 885
Cited by:  Papers (28)
| | PDF (3168 KB) | HTML

A two-hop wireless communication link in which a source sends data to a destination with the aid of an intermediate relay node is studied. It is assumed that there is no direct link between the source and the destination, and the relay forwards the information to the destination by employing the decode-and-forward scheme. Both the source and intermediate relay nodes are assumed to operate under st... View full abstract»

• ### Capacity Bounds and Exact Results for the Cognitive Z-Interference Channel

Publication Year: 2013, Page(s):886 - 893
Cited by:  Papers (10)
| | PDF (1479 KB) | HTML

We study the discrete memoryless Z-interference channel where the transmitter of the pair that suffers from interference is cognitive. We first provide an outer bound on the capacity region of this channel. We then show that, when the channel of the transmitter-receiver pair that does not experience interference is deterministic and invertible, our proposed outer bound matches the best known inner... View full abstract»

• ### Further Results on the Asymptotic Mutual Information of Rician Fading MIMO Channels

Publication Year: 2013, Page(s):894 - 915
Cited by:  Papers (6)
| | PDF (8239 KB) | HTML

Rician fading multiple-input multiple-output (MIMO) channels with Kronecker-decomposable covariance structure are considered in this study to derive information measures characterizing their achievable rate. Analytic results are obtained in the asymptotic setting corresponding to infinitely many transmit and receive antennas, whose numbers approach a finite limiting ratio. More specifically, the a... View full abstract»

• ### Multicarrier Beamforming With Limited Feedback: A Rate Distortion Approach

Publication Year: 2013, Page(s):916 - 927
Cited by:  Papers (3)
| | PDF (2384 KB) | HTML

This paper studies the optimal use of limited-rate feedback of channel state information (CSI) in the case of a wideband multicarrier channel with multiple transmit antennas and a single receive antenna. With full knowledge of the CSI, the receiver should compute the optimal beamforming vectors, jointly quantize them, and feed them back to the transmitter. The achievable forward data rate depends ... View full abstract»

• ### Capacity of DNA Data Embedding Under Substitution Mutations

Publication Year: 2013, Page(s):928 - 941
Cited by:  Papers (8)
| | PDF (4036 KB) | HTML

A number of methods have been proposed over the last decade for encoding information using deoxyribonucleic acid (DNA), giving rise to the emerging area of DNA data embedding. Since a DNA sequence is conceptually equivalent to a sequence of quaternary symbols (bases), DNA data embedding (diversely called DNA watermarking or DNA steganography) can be seen as a digital communications problem where c... View full abstract»

• ### Capacity of a Diffusion-Based Molecular Communication System With Channel Memory and Molecular Noise

Publication Year: 2013, Page(s):942 - 954
Cited by:  Papers (86)
| | PDF (2131 KB) | HTML

Molecular Communication (MC) is a communication paradigm based on the exchange of molecules. The implicit biocompatibility and nanoscale feasibility of MC make it a promising communication technology for nanonetworks. This paper provides a closed-form expression for the information capacity of an MC system based on the free diffusion of molecules, which is of primary importance to understand the p... View full abstract»

• ### Polar Codes for Q-Ary Channels, $q=2^{r}$

Publication Year: 2013, Page(s):955 - 969
Cited by:  Papers (25)
| | PDF (5025 KB) | HTML

We study polarization for nonbinary channels with input alphabet of size q=2r, r=2,3,.... Using Arıkan's polarizing kernel H2, we prove that the virtual channels that arise in the process of channel evolution converge to q-ary channels with capacity 0,1,2,..., r bits. As a result of this analysis, we show that polar codes support reli... View full abstract»

• ### Spectral Distribution of Product of Pseudorandom Matrices Formed From Binary Block Codes

Publication Year: 2013, Page(s):970 - 978
Cited by:  Papers (1)
| | PDF (3106 KB) | HTML

Let A ∈ {-1,1}Na ×n and B ∈ {-1,1}Nb ×n be two matrices whose rows are drawn i.i.d. from the codewords of the binary codes Ca and Cb of length n and dual distances d'a and d'b, respectively, under the mapping 0 → 1 and 1 → -1. It is proven that as n → ∞ wi... View full abstract»

• ### The Concatenated Structure of Quasi-Cyclic Codes and an Improvement of Jensen's Bound

Publication Year: 2013, Page(s):979 - 985
Cited by:  Papers (3)
| | PDF (1982 KB) | HTML

Following Jensen's work from 1985, a quasi-cyclic code can be written as a direct sum of concatenated codes, where the inner codes are minimal cyclic codes and the outer codes are linear codes. We observe that the outer codes are nothing but the constituents of the quasi-cyclic code in the sense of Ling-Solé. This concatenated structure enables us to recover some earlier results on quasi-c... View full abstract»

• ### Weight Spectrum of Codes Associated With the Grassmannian $G(3,7)$

Publication Year: 2013, Page(s):986 - 993
Cited by:  Papers (1)
| | PDF (3292 KB) | HTML

In this paper, we consider the problem of determining the weight spectrum of q -ary codes C(3,m) associated with Grassmann varieties G(3,m). For m=6, this was done in a paper by Nogin in 1997. We derive a formula for the weight of a codeword of C(3,m), in terms of certain varieties associated with alternating trilinear forms on Fq... View full abstract»

• ### Robust Parent-Identifying Codes and Combinatorial Arrays

Publication Year: 2013, Page(s):994 - 1003
Cited by:  Papers (2)
| | PDF (2402 KB) | HTML

An n-word y=(y1,..., yn) over a finite alphabet of cardinality q is called a descendant of a set of t words x1,..., xt if every coordinate yi,i=1,..., n, is contained in the set {x1i,..., xti}. A code C={x1,..., xM} is said to have the ... View full abstract»

• ### Codes and Designs Related to Lifted MRD Codes

Publication Year: 2013, Page(s):1004 - 1017
Cited by:  Papers (20)
| | PDF (4408 KB) | HTML

Lifted maximum rank distance (MRD) codes, which are constant dimension codes, are considered. It is shown that a lifted MRD code can be represented in such a way that it forms a block design known as a transversal design. A slightly different representation of this design makes it similar to a q -analog of a transversal design. The structure of these designs is used to obtain upper bounds o... View full abstract»

• ### Constructions of Rank Modulation Codes

Publication Year: 2013, Page(s):1018 - 1029
Cited by:  Papers (25)
| | PDF (2918 KB) | HTML

Rank modulation is a way of encoding information to correct errors in flash memory devices as well as impulse noise in transmission lines. Modeling rank modulation involves construction of packings of the space of permutations equipped with the Kendall tau distance. As our main set of results, we present several general constructions of codes in permutations that cover a broad range of code parame... View full abstract»

• ### Construction of Network Error Correction Codes in Packet Networks

Publication Year: 2013, Page(s):1030 - 1047
Cited by:  Papers (9)
| | PDF (5676 KB) | HTML

Recently, network error correction coding (NEC) has been studied extensively. Several bounds in classical coding theory have been extended to NEC, especially the Singleton bound. In this paper, following the research line using the extended global encoding kernels proposed by Zhang in 2008, the refined Singleton bound of NEC can be proved more explicitly. Moreover, we give a constructive proof of ... 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