# IEEE Transactions on Information Theory

## Volume 64 Issue 4  Part 1 • April 2018

This issue contains several parts.Go to:  Part 2

The purchase and pricing options for this item are unavailable. Select items are only available as part of a subscription package. You may try again later or contact us for more information.

## Filter Results

Displaying Results 1 - 25 of 45

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

Publication Year: 2018, Page(s): C2
| PDF (110 KB)
• ### A Strong Entropy Power Inequality

Publication Year: 2018, Page(s):2173 - 2192
Cited by:  Papers (1)
| | PDF (424 KB) | HTML

When one of the random summands is Gaussian, we sharpen the entropy power inequality (EPI) in terms of the strong data processing function for Gaussian channels. Among other consequences, this `strong' EPI generalizes the vector extension of Costa's EPI to non-Gaussian channels in a precise sense. This leads to a new reverse EPI and, as a corollary, sharpens Stam's uncertainty principle relating e... View full abstract»

• ### $\Phi$ -Entropic Measures of Correlation

Publication Year: 2018, Page(s):2193 - 2211
| | PDF (392 KB) | HTML

A measure of correlation is said to have the tensorization property if it does not change when computed for i.i.d. copies. More precisely, a measure of correlation between two random variables X, Y denoted by p(X, Y), has the tensorization property if p(Xn, Yn) = p(X, Y) where (Xn, Yn) denotes n i.i.d. copies of (X, Y). Two well-known examples of such me... View full abstract»

• ### Maximal Repetition and Zero Entropy Rate

Publication Year: 2018, Page(s):2212 - 2219
| | PDF (247 KB) | HTML

Maximal repetition of a string is the maximal length of a repeated substring. This paper investigates maximal repetition of strings drawn from stochastic processes. Strengthening previous results, two new bounds for the almost sure growth rate of maximal repetition are identified: an upper bound in terms of conditional Rényi entropy of order γ > 1 given a sufficiently long past and a lower boun... View full abstract»

• ### Bounds on the Entropy of a Function of a Random Variable and Their Applications

Publication Year: 2018, Page(s):2220 - 2230
Cited by:  Papers (1)
| | PDF (447 KB) | HTML

It is well known that the entropy H(X) of a discrete random variable X is always greater than or equal to the entropy H(f(X)) of a function f of X, with equality if and only if f is one-to-one. In this paper, we give tight bounds on H(f(X)), when the function f is not one-to-one, and we illustrate a few scenarios, where this matters. As an intermediate step toward our main result, we derive a lowe... View full abstract»

• ### Universal Decoding Using a Noisy Codebook

Publication Year: 2018, Page(s):2231 - 2239
| | PDF (250 KB) | HTML

We consider the topic of universal decoding with a decoder that does not have direct access to the codebook, but only to noisy versions of the various randomly generated codewords, a problem motivated by biometrical identification systems. Both the source that generates the original (clean) codewords, and the channel that corrupts them in generating the noisy codewords, as well as the main channel... View full abstract»

• ### Universal Random Access Error Exponents for Codebooks of Different Blocklengths

Publication Year: 2018, Page(s):2240 - 2252
| | PDF (768 KB) | HTML

Csiszár's channel coding theorem for multiple codebooks is generalized allowing the code word lengths differ across codebooks. Also in this case, for each codebook an error exponent can be achieved that equals the random coding exponent for this codebook alone. In addition, when the rate and code word-type of the employed codebook do not admit reliable transmission over the given channel, overload... View full abstract»

• ### Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel

Publication Year: 2018, Page(s):2253 - 2266
Cited by:  Papers (1)
| | PDF (486 KB) | HTML

This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is considered, and achievable rate regions and error exponents are derived both for the standard MAC (independent codebooks), and for the cognitive MAC (one user knows b... View full abstract»

• ### Achievable Rate Region for Three User Discrete Broadcast Channel Based on Coset Codes

Publication Year: 2018, Page(s):2267 - 2297
| | PDF (2041 KB) | HTML

We consider the problem of developing coding techniques and deriving achievable rate regions for discrete memoryless broadcast channels with three receivers (3-DBC). We begin by identifying a novel vector additive 3-DBC for which we characterize an upper bound on the the largest achievable rate region based on unstructured codes, henceforth referred to as 1 M-region. We propose a coding technique ... View full abstract»

• ### Degrees of Freedom of the Bursty MIMO X Channel Without Feedback

Publication Year: 2018, Page(s):2298 - 2320
Cited by:  Papers (1)
| | PDF (2249 KB) | HTML

We study the sum degrees of freedom (DoF) of the bursty MIMO X channel without feedback, where the four transmitter-receiver links are intermittently ON and OFF, controlled by four Bernoulli random sequences which may be arbitrarily correlated, subject to a symmetry assumption: The two direct-links have the same level of burstiness, modeled by Ber(p<sub>d</sub>), and so do the cross-li... View full abstract»

• ### Achievable Rates for Discrete Memoryless Multicast Networks With and Without Feedback

Publication Year: 2018, Page(s):2321 - 2332
| | PDF (817 KB) | HTML

Discrete memoryless multicast network (DM-MN) is considered in this paper. We analyze the lower bounds of noisy network coding (NNC) and distributed decode-forward (DDF) for DM-MN, and show that both NNC and DDF ignore the channel output observed at the transmitter. Motivated by this observation, new coding schemes are proposed to improve NNC and DDF by exploiting the transmitter's observation and... View full abstract»

• ### On Gaussian MACs With Variable-Length Feedback and Non-Vanishing Error Probabilities

Publication Year: 2018, Page(s):2333 - 2346
| | PDF (316 KB) | HTML

We characterize the fundamental limits of transmission of information over a Gaussian multiple access channel (MAC) with the use of variable-length feedback codes and under a non-vanishing error probability formalism. We develop new achievability and converse techniques to handle the continuous nature of the channel and the presence of expected power constraints. We establish the ε-capacity region... View full abstract»

• ### Capacity of the Energy Harvesting Gaussian MAC

Publication Year: 2018, Page(s):2347 - 2360
| | PDF (413 KB) | HTML

We consider an energy harvesting multiple access channel (MAC) where the transmitters are powered by an exogenous stochastic energy harvesting process and equipped with finite batteries. We characterize the capacity region of this channel as n-letter mutual information rate and develop inner and outer bounds that differ by a constant gap. An interesting conclusion that emerges from our results is ... View full abstract»

• ### The Capacity of Robust Private Information Retrieval With Colluding Databases

Publication Year: 2018, Page(s):2361 - 2370
Cited by:  Papers (3)
| | PDF (280 KB) | HTML

Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of K messages from N non-communicating replicated databases (each holds all K messages) while keeping the identity of the desired message index a secret from each individual database. The information theoretic capacity of PIR (equivalently, the reciprocal of minimum download cost) is the maximum nu... View full abstract»

• ### On the Optimality of Secret Key Agreement via Omniscience

Publication Year: 2018, Page(s):2371 - 2389
| | PDF (530 KB) | HTML

For the multiterminal secret key agreement problem under a private source model, it is known that the maximum key rate, i.e., the secrecy capacity, can be achieved through communication for omniscience, but the omniscience strategy can be strictly suboptimal in terms of minimizing the public discussion rate. While a single-letter characterization is not known for the minimum discussion rate needed... View full abstract»

• ### Complementary Dual Algebraic Geometry Codes

Publication Year: 2018, Page(s):2390 - 2397
Cited by:  Papers (2)
| | PDF (355 KB) | HTML

Linear complementary dual (LCD) codes are a class of linear codes introduced by Massey in 1964. LCD codes have been extensively studied in literature recently. In addition to their applications in data storage, communications systems, and consumer electronics, LCD codes have been employed in cryptography. More specifically, it has been shown that LCD codes can also help improve the security of the... View full abstract»

• ### Metrics Based on Finite Directed Graphs and Coding Invariants

Publication Year: 2018, Page(s):2398 - 2409
| | PDF (372 KB) | HTML

Given a finite directed graph with n vertices, we define a metric dG on Fnq, where Fq is the finite field with q elements. The weight of a word is defined as the number of vertices that can be reached by a directed path from a vertex within the support of the vector. Two canonical forms, which do not affect the metric, are given to each graph. Based on these forms we characterize each such metric.... View full abstract»

• ### List Decoding of Cover Metric Codes Up to the Singleton Bound

Publication Year: 2018, Page(s):2410 - 2416
| | PDF (235 KB) | HTML

Wachter-Zeh showed that every cover metric code can be list decoded up to the Johnson-like bound. Furthermore, it was shown that the efficient list decoding of cover metric codes up to the Johnson-like bound can be performed. From the work of Wachter-Zeh, one natural question is whether the Johnson-like bound can be improved. In this paper, we give a confirmative answer to this question by showing... View full abstract»

• ### On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths

Publication Year: 2018, Page(s):2417 - 2430
Cited by:  Papers (2)
| | PDF (282 KB) | HTML

Let p be a prime, and λ be a nonzero element of the finite field Fpm. The λ-constacyclic codes of length psover Fpmare linearly ordered under set-theoretic inclusion, i.e., they are the ideals 〈(x - λ0)i〉, 0 ≤ i ≤ psof the chain ring [(Fpm[x])/((xps- λ))]. This struct... View full abstract»

• ### Prefixless $q$ -Ary Balanced Codes With Fast Syndrome-Based Error Correction

Publication Year: 2018, Page(s):2431 - 2443
| | PDF (1643 KB) | HTML

We investigate a Knuth-like scheme for balancing q-ary code words, which has the virtue that lookup tables for coding and decoding the prefix are avoided by using precoding and error correction techniques. We show how the scheme can be extended to allow for error correction of single channel errors using a fast decoding algorithm that depends on syndromes only, making it considerably faster compar... View full abstract»

• ### Improved Constructions of Nested Code Pairs

Publication Year: 2018, Page(s):2444 - 2459
| | PDF (1565 KB) | HTML

Two new constructions of linear code pairs C2⊂ C1are given for which the codimension and the relative minimum distances M1(C1, C2) and M1(C2⊥, C1⊥) are good. By this, we mean that for any two out of the three parameters the third parameter of the constructed code pair is large. Such pairs ... View full abstract»

• ### Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding

Publication Year: 2018, Page(s):2460 - 2473
Cited by:  Papers (1)
| | PDF (694 KB) | HTML

This paper considers vector network coding solutions based on rank-metric codes and subspace codes. The main result of this paper is that vector solutions can significantly reduce the required alphabet size compared to the optimal scalar linear solution for the same multicast network. The multicast networks considered in this paper have one source with h messages, and the vector solution is over a... View full abstract»

• ### On Encoding Semiconstrained Systems

Publication Year: 2018, Page(s):2474 - 2484
| | PDF (302 KB) | HTML

Semiconstrained systems (SCSs) were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply the techniques from constrained systems, we study the sequences of constrained systems that are contained in, or contain, a given SCS, while approaching its capa... View full abstract»

• ### Consecutive Switch Codes

Publication Year: 2018, Page(s):2485 - 2498
| | PDF (925 KB) | HTML

Switch codes, first proposed by Wang et al., are codes that are designed to increase the parallelism of data writing and reading processes in network switches. A network switch is required to write n incoming packets and read k outgoing packets while using m memory banks, each able to write and read one packet per time unit. Each set of n packets written to the switch simultaneously is called a ge... 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