# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 43

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

Publication Year: 2017, Page(s): C2
| PDF (111 KB)
• ### $E_{ {\gamma }}$ -Resolvability

Publication Year: 2017, Page(s):2629 - 2658
Cited by:  Papers (2)
| | PDF (762 KB) | HTML

The conventional channel resolvability refers to the minimum rate needed for an input process to approximate the channel output distribution in total variation distance. In this paper, we study Eγ-resolvability, in which total variation is replaced by the more general Eγ distance. A general one-shot achievability bound for the precision of such an approximation ... View full abstract»

• ### Simulation of a Channel With Another Channel

Publication Year: 2017, Page(s):2659 - 2677
| | PDF (858 KB) | HTML

In this paper, we study the problem of simulating a discrete memoryless channel (DMC) from another DMC under an average-case and an exact model. We present several achievability and infeasibility results, with tight characterizations in special cases. In particular, for the exact model, we fully characterize when a binary symmetric channel can be simulated from a binary erasure channel when there ... View full abstract»

• ### Gaussian Multiple Access via Compute-and-Forward

Publication Year: 2017, Page(s):2678 - 2695
Cited by:  Papers (5)
| | PDF (1529 KB) | HTML

Lattice codes used under the compute-and-forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): the receiver successively decodes the integer linear combinations of the messages until it can invert and recover all messages. In this paper, a multiple-access technique called compute-forward multiple access (CFMA) is proposed and analyzed. For the tw... View full abstract»

• ### Reliability of Universal Decoding Based on Vector-Quantized Codewords

Publication Year: 2017, Page(s):2696 - 2709
Cited by:  Papers (1)
| | PDF (254 KB) | HTML

Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes vector quantization, and where the decoder bases its decision only on the compressed codewords and the channel output, which is, in turn, the channel's response to the transmission of an original codeword, before compression.... View full abstract»

• ### The Discrete Memoryless Interference Channel With One-Sided Generalized Feedback and Secrecy

Publication Year: 2017, Page(s):2710 - 2725
| | PDF (376 KB) | HTML

We study the interference channel with one-sided generalized feedback and secrecy requirement. In our model Message 1 that is known just to Encoder 1 should be decoded by both receivers. Message 2-known only to Encoder 2-should be decoded by Decoder 2 and kept as secret as possible from Decoder 1. The uncertainty of Decoder 1 about Message 2 is measured by means of the equivocation rate. In additi... View full abstract»

• ### Exact Moderate Deviation Asymptotics in Streaming Data Transmission

Publication Year: 2017, Page(s):2726 - 2736
Cited by:  Papers (1)
| | PDF (377 KB) | HTML

In this paper, a streaming transmission setup is considered, where an encoder observes a new message in the beginning of each block and a decoder sequentially decodes each message after a delay of T blocks. In this streaming setup, the fundamental interplay between the coding rate, the error probability, and the blocklength in the moderate deviations regime is studied. For output symmetric channel... View full abstract»

• ### Finite-Length Linear Schemes for Joint Source-Channel Coding Over Gaussian Broadcast Channels With Feedback

Publication Year: 2017, Page(s):2737 - 2772
Cited by:  Papers (1)
| | PDF (1334 KB) | HTML

In this paper, we study linear encoding for a pair of correlated Gaussian sources transmitted over a two-user Gaussian broadcast channel in the presence of unit-delay noiseless feedback, abbreviated as the GBCF. Each pair of source samples is transmitted using a linear transmission scheme in a finite number of channel uses. We investigate three linear transmission schemes: A scheme based on the Oz... View full abstract»

• ### Spherically Punctured Reed–Muller Codes

Publication Year: 2017, Page(s):2773 - 2780
| | PDF (326 KB) | HTML

Consider a binary Reed-Muller code RM(r, m) defined on the m-dimensional hypercube F2m. In this paper, we study punctured Reed-Muller codes Pr(m, b), whose positions are restricted to the m-tuples of a given Hamming weight b. In combinatorial terms, this paper concerns m-variate Boolean polynomials of any degree r, which are evaluated on a Hamming sphere of some ra... View full abstract»

• ### On the VLSI Energy Complexity of LDPC Decoder Circuits

Publication Year: 2017, Page(s):2781 - 2795
Cited by:  Papers (2)
| | PDF (521 KB) | HTML

Sequences of randomly generated bipartite configurations are analyzed; under mild conditions almost surely such configurations have minimum bisection width proportional to the number of vertices. This implies an almost sure Ω(n2/dmax2) scaling rule for the energy of directlyimplemented low-density parity-check (LDPC) decoder circuits for codes of block lengt... View full abstract»

• ### Ideal Codes Over Separable Ring Extensions

Publication Year: 2017, Page(s):2796 - 2813
| | PDF (342 KB) | HTML

In this paper, an application of the theoretical algebraic notion of a separable ring extension in the realm of cyclic convolutional codes or, more generally, ideal codes, is investigated. It is worked under very mild conditions that cover all previously known as well as new non-trivial examples. It is proved that ideal codes are direct summands, as left ideals, of the underlying non-commutative a... View full abstract»

• ### From Random Matrix Theory to Coding Theory: Volume of a Metric Ball in Unitary Group

Publication Year: 2017, Page(s):2814 - 2821
| | PDF (589 KB) | HTML

Volume estimates of metric balls in manifolds find diverse applications in information and coding theory. In this paper, new results for the volume of a metric ball in unitary group are derived via tools from random matrix theory. The first result is an integral representation of the exact volume, which involves a Toeplitz determinant of Bessel functions. A simple but accurate limiting volume form... View full abstract»

• ### The MDS Queue: Analysing the Latency Performance of Erasure Codes

Publication Year: 2017, Page(s):2822 - 2842
| | PDF (1647 KB) | HTML

In order to scale economically, data centers are increasingly evolving their data storage methods from simple data replication to more powerful erasure codes, which provide the same level of reliability as replication, but at a significantly lower storage cost. In particular, it is well known that maximum-distance-separable (MDS) codes, such as Reed-Solomon codes, can achieve a target reliability ... View full abstract»

• ### Construction of MDS Codes With Complementary Duals

Publication Year: 2017, Page(s):2843 - 2847
Cited by:  Papers (1)
| | PDF (164 KB) | HTML

A linear complementary dual (LCD) code is a linear code with complimentary dual. LCD codes have been extensively studied in literature. On the other hand, maximum distance separable (MDS) codes are an important class of linear codes that have found wide applications in both theory and practice. However, little is known about MDS codes with complimentary duals. The main purpose of this paper is to ... View full abstract»

• ### Burst-Erasure Correcting Codes With Optimal Average Delay

Publication Year: 2017, Page(s):2848 - 2865
| | PDF (1573 KB) | HTML

The objective of low-delay codes is to protect communication streams from erasure bursts by minimizing the time between the packet erasure and its reconstruction. Previous work has concentrated on the constant-delay scenario, where all erased packets need to exhibit the same decoding delay. We consider the case of heterogeneous delay, where the objective is to minimize the average delay across the... View full abstract»

• ### Minimax Compression and Large Alphabet Approximation Through Poissonization and Tilting

Publication Year: 2017, Page(s):2866 - 2884
| | PDF (762 KB) | HTML

This paper introduces a convenient strategy for coding and predicting sequences of independent, identically distributed random variables generated from a large alphabet of size m. In particular, the size of the sample is allowed to be variable. The employment of a Poisson model and tilting method simplifies the implementation and analysis through independence. The resulting strategy is optimal wit... View full abstract»

• ### Variable-Length Prefix Codes With Multiple Delimiters

Publication Year: 2017, Page(s):2885 - 2895
| | PDF (858 KB) | HTML

Let m1, m2, . . . , mt be a fixed set of natural integers given in ascending order. A multi-delimiter code Dm1,...,mt consists of t words of the form 1mi0 and all other binary words with suffixes having one of the forms 01mi 0 that cannot occur in other places of a word, i = 1, . . . , t. Completeness, universality, and density characteristics... View full abstract»

• ### Second-Order and Moderate Deviations Asymptotics for Successive Refinement

Publication Year: 2017, Page(s):2896 - 2921
Cited by:  Papers (4)
| | PDF (591 KB) | HTML

We derive the optimal second-order coding region and moderate deviations constant for successive refinement source coding with a joint excess-distortion probability constraint. We consider two scenarios: 1) a discrete memoryless source (DMS) and arbitrary distortion measures at the decoders and 2) a Gaussian memoryless source (GMS) and quadratic distortion measures at the decoders. For a DMS with ... View full abstract»

• ### Reconstruction Guarantee Analysis of Basis Pursuit for Binary Measurement Matrices in Compressed Sensing

Publication Year: 2017, Page(s):2922 - 2932
Cited by:  Papers (1)
| | PDF (362 KB) | HTML

Recently, binary 0-1 measurement matrices, especially those from coding theory, were introduced to compressed sensing. Dimakis et al. found that the linear programming (LP) decoding of LDPC codes is very similar to the LP reconstruction of compressed sensing, and they further showed that the sparse binary parity-check matrices of good LDPC codes can be used as provably good measurement matrices fo... View full abstract»

• ### Universal Compressed Sensing for Almost Lossless Recovery

Publication Year: 2017, Page(s):2933 - 2953
Cited by:  Papers (1)
| | PDF (346 KB) | HTML

In this paper, the problem of developing universal algorithms for noiseless compressed sensing of stochastic processes is studied. First, Rényi's notion of information dimension (ID) is generalized to continuous-valued discrete-time stationary processes. This provides a measure of complexity for such processes and is connected to the rate of measurement (sampling rate) required for their a... View full abstract»

• ### Preconditioned Data Sparsification for Big Data With Applications to PCA and K-Means

Publication Year: 2017, Page(s):2954 - 2974
| | PDF (1712 KB) | HTML

We analyze a compression scheme for large data sets that randomly keeps a small percentage of the components of each data sample. The benefit is that the output is a sparse matrix, and therefore, subsequent processing, such as principal component analysis (PCA) or K-means, is significantly faster, especially in a distributed-data setting. Furthermore, the sampling is single-pass and applicable to ... View full abstract»

• ### On the Asymptotic Equivalence of Circulant and Toeplitz Matrices

Publication Year: 2017, Page(s):2975 - 2992
| | PDF (611 KB) | HTML

Any sequence of uniformly bounded N × N Hermitian Toeplitz matrices (HN) is asymptotically equivalent to a certain sequence of N×N circulant matrices (CN) derived from the Toeplitz matrices in the sense that ∥HN - CN∥F = o(√N) as N → ∞. This implies that certain collective behaviors of the eigen... View full abstract»

• ### Phase Retrieval for Wavelet Transforms

Publication Year: 2017, Page(s):2993 - 3009
| | PDF (1838 KB) | HTML

This paper describes a new algorithm that solves a particular phase retrieval problem, with important applications in audio processing: the reconstruction of a function from its scalogram, that is, from the modulus of its wavelet transform. It is a multiscale iterative algorithm that reconstructs the signal from low-to-high frequencies. It relies on a new reformulation of the phase retrieval probl... View full abstract»

• ### Learning Immune-Defectives Graph Through Group Tests

Publication Year: 2017, Page(s):3010 - 3028
| | PDF (1233 KB) | HTML

This paper deals with an abstraction of a unified problem of drug discovery and pathogen identification. Pathogen identification involves the identification of disease-causing biomolecules. Drug discovery involves finding chemical compounds, called lead compounds, that bind to pathogenic proteins and eventually inhibit the function of the protein. In this paper, the lead compounds are abstracted a... 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