IEEE Transactions on Information Theory

Filter Results

Displaying Results 1 - 25 of 42

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

Publication Year: 2015, Page(s): C2
| |PDF (140 KB)
• An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels

Publication Year: 2015, Page(s):2953 - 2963
Cited by:  Papers (4)
| |PDF (958 KB) | HTML

Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk-Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are difficult to analyze (posterior matching). This paper introduces a new fixed-length feedback coding scheme which achieves the capacity for all discrete memoryless channe... View full abstract»

• Channel Simulation via Interactive Communications

Publication Year: 2015, Page(s):2964 - 2982
Cited by:  Papers (5)
| |PDF (565 KB) | HTML

In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals observe independent identically distributed (i.i.d.) copies of two random variables and would like to generate i.i.d. copies of two other random variables jointly distributed with the observed random variables. The term... View full abstract»

• Generalized Cut-Set Bounds for Broadcast Networks

Publication Year: 2015, Page(s):2983 - 2996
Cited by:  Papers (2)
| |PDF (451 KB) | HTML

An explicit characterization of the capacity region of the general network coding problem is one of the best known open problems in information theory. A simple set of bounds that is often used in the literature to show that certain rate tuples are infeasible are based on the graph-theoretic notion of cut. The standard cut-set bounds, however, are known to be loose in general when there are multip... View full abstract»

• Coding Theorems for Compound Problems via Quantum Rényi Divergences

Publication Year: 2015, Page(s):2997 - 3012
Cited by:  Papers (6)
| |PDF (329 KB) | HTML

Recently, a new notion of quantum Rényi divergences has been introduced by Müller-Lennert, Dupuis, Szehr, Fehr, and Tomamichel and Wilde, Winter, and Yang, which found a number of applications in strong converse theorems. Here, we show that these new Rényi divergences are also useful tools to obtain coding theorems in the direct domain of various problems. We demonstrate th... View full abstract»

• Analyticity of Entropy Rate of Hidden Markov Chains With Continuous Alphabet

Publication Year: 2015, Page(s):3013 - 3028
Cited by:  Papers (2)
| |PDF (334 KB) | HTML

We first prove that under certain mild assumptions, the entropy rate of a hidden Markov chain, observed when passing a finite-state stationary Markov chain through a discrete-time continuous-output channel, is analytic with respect to the input Markov chain parameters. We then further prove, under strengthened assumptions on the channel, that the entropy rate is jointly analytic as a function of b... View full abstract»

• Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels

Publication Year: 2015, Page(s):3029 - 3040
Cited by:  Papers (2)
| |PDF (278 KB) | HTML

A new universal coding/decoding scheme for random access with collision detection is given in case of two senders. The result is used to give achievable joint source-channel coding error exponents for multiple access channel and independent sources. In a modified model admitting zero rate communication between the senders, an improved exponent is derived, of form similar to Csiszár's joint... View full abstract»

• Index Coding Capacity: How Far Can One Go With Only Shannon Inequalities?

Publication Year: 2015, Page(s):3041 - 3055
Cited by:  Papers (8)
| |PDF (6354 KB) | HTML

An interference alignment perspective is used to identify the simplest instances (minimum possible number of edges in the alignment graph, not more than 2 interfering messages at any destination) of index coding problems where non-Shannon information inequalities are necessary for capacity characterization. In particular, this includes the first known example of a multiple unicast (one destination... View full abstract»

• From Small-World Networks to Comparison-Based Search

Publication Year: 2015, Page(s):3056 - 3074
| |PDF (766 KB) | HTML

The problem of content search through comparisons has recently received considerable attention. In short, a user searching for a target object navigates through a database in the following manner. The user is asked to select the object most similar to her target from a small list of objects. A new object list is then presented to the user based on her earlier selection. This process is repeated un... View full abstract»

• Optimal Skampling for the Flow Size Distribution

Publication Year: 2015, Page(s):3075 - 3099
Cited by:  Papers (2)
| |PDF (2076 KB) | HTML

We introduce a new method of data collection for flow size estimation, the optimized flow sampling sketch, which combines the optimal properties of flow sampling with the computational advantages of a counter array sketch. Using Fisher information as a definitive basis of comparison, we show that the statistical efficiency of the method is within a constant factor of that of flow sampling, which i... View full abstract»

• Distinguishing Infections on Different Graph Topologies

Publication Year: 2015, Page(s):3100 - 3120
Cited by:  Papers (1)
| |PDF (1211 KB) | HTML

The history of infections and epidemics holds famous examples where understanding, containing, and ultimately treating an outbreak began with understanding its mode of spread. Influenza, HIV, and most computer viruses spread person to person, device to device, and through contact networks; Cholera, Cancer, and seasonal allergies, on the other hand, do not. In this paper, we study two fundamental q... View full abstract»

• An Information Theoretic Approach to Secret Sharing

Publication Year: 2015, Page(s):3121 - 3136
Cited by:  Papers (3)
| |PDF (661 KB) | HTML

A novel information theoretic approach is proposed to solve the secret sharing problem, in which a dealer distributes one or multiple secrets among a set of participants in such a manner that for each secret only qualified sets of users can recover this secret by pooling their shares together while nonqualified sets of users obtain no information about the secret even if they pool their shares tog... View full abstract»

• Online Fountain Codes With Low Overhead

Publication Year: 2015, Page(s):3137 - 3149
Cited by:  Papers (10)
| |PDF (923 KB) | HTML

An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formalize the problem of online fountain code construction, and propose new online fountain codes that outperform known ones in having factor 3-5 lower ... View full abstract»

• Block Markov Superposition Transmission: Construction of Big Convolutional Codes From Short Codes

Publication Year: 2015, Page(s):3150 - 3163
Cited by:  Papers (24)
| |PDF (2212 KB) | HTML

A construction of big convolutional codes from short codes called block Markov superposition transmission (BMST) is proposed. The BMST is very similar to superposition block Markov encoding (SBME), which has been widely used to prove multiuser coding theorems. The BMST codes can also be viewed as a class of spatially coupled codes, where the generator matrices of the involved short codes (referred... View full abstract»

• A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

Publication Year: 2015, Page(s):3164 - 3184
Cited by:  Papers (15)
| |PDF (1883 KB) | HTML

Spatially-coupled low-density parity-check (SC-LDPC) codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially coupled code ensembles when transmission takes place over the binary erasure channel. We discuss how the parameters of the scaling law are conn... View full abstract»

• Energy Consumption of VLSI Decoders

Publication Year: 2015, Page(s):3185 - 3198
Cited by:  Papers (7)
| |PDF (510 KB) | HTML

Thompson's model of very large scale integration computation relates the energy of a computation to the product of the circuit area and the number of clock cycles needed to carry out the computation. It is shown that for any sequence of increasing block-length decoder circuits implemented according to this model, if the probability of block error is asymptotically less than 1/2 then the energy of ... View full abstract»

• Convolutional Codes in Rank Metric With Application to Random Network Coding

Publication Year: 2015, Page(s):3199 - 3213
Cited by:  Papers (6)
| |PDF (774 KB) | HTML

Random network coding recently attracts attention as a technique to disseminate information in a network. This paper considers a noncoherent multishot network, where the unknown and time-variant network is used several times. In order to create dependence between the different shots, particular convolutional codes in rank metric are used. These codes are so-called (partial) unit memory ((P)UM) cod... View full abstract»

• Using the Structure of Subfields in the Construction of Goppa Codes and Extended Goppa Codes

Publication Year: 2015, Page(s):3214 - 3224
| |PDF (231 KB) | HTML

It is shown that for some location sets and some integral multiple power Galois fields that some new general subclasses of Goppa codes may be defined which have improved lower bounds to code dimension and minimum distance compared with ordinary Goppa codes. Some previously published results are shown to be particular cases of these general subclasses of codes. A new subclass of reversible Goppa co... View full abstract»

• Sub-Quadratic Decoding of One-Point Hermitian Codes

Publication Year: 2015, Page(s):3225 - 3240
Cited by:  Papers (1)
| |PDF (861 KB) | HTML

We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realization of the Guruswami-Sudan algorithm using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimization. The second is a power decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding a... View full abstract»

• Bounds on the Size of Permutation Codes With the Kendall $\tau$ -Metric

Publication Year: 2015, Page(s):3241 - 3250
Cited by:  Papers (7)
| |PDF (505 KB) | HTML

The rank modulation scheme has been proposed for efficient writing and storing data in nonvolatile memory storage. Error correction in the rank modulation scheme is done by considering permutation codes. In this paper, we consider codes in the set of all permutations on n elements, Sn, using the Kendall τ-metric. The main goal of this paper is to derive new bounds on the size of ... View full abstract»

• $m$ -ary Balanced Codes With Parallel Decoding

Publication Year: 2015, Page(s):3251 - 3264
Cited by:  Papers (2)
| |PDF (1257 KB) | HTML

An m-ary block code, m = 2, 3, 4,..., of length n ϵ IN is called balanced if, and only if, every codeword is balanced; that is, the real sum of the codeword components, or weight, is equal to ⌊(m - 1)n/2⌋. This paper presents efficient encoding schemes to m-ary balanced codes with parallel (hence, fast) decoding. In fact, the decoding time complexity is O(1) digit operations. ... View full abstract»

• Linear Codes From Some 2-Designs

Publication Year: 2015, Page(s):3265 - 3275
Cited by:  Papers (49)
| |PDF (681 KB) | HTML

A classical method of constructing a linear code over GF(q) with a t-design is to use the incidence matrix of the t-design as a generator matrix over GF(q) of the code. This approach has been extensively investigated in the literature. In this paper, a different method of constructing linear codes using specific classes of 2-designs is studied, and linear codes with a few weights are obtained from... View full abstract»

• Character Sum Factorizations Yield Sequences With Ideal Two-Level Autocorrelation

Publication Year: 2015, Page(s):3276 - 3304
| |PDF (587 KB) | HTML

We give a new existence criterion for p-ary sequences which have ideal two-level autocorrelation; and we use it to obtain four general families of such sequences: one for p=2, one for general odd primes p and two special ones for p=3. The binary family turns out to be equivalent to that discovered by Dillon and Dobbertin and published in 2004. The general p-ary family is equivalent to that discove... View full abstract»

• Multilength Optical Orthogonal Codes: New Upper Bounds and Optimal Constructions

Publication Year: 2015, Page(s):3305 - 3315
Cited by:  Papers (3)
| |PDF (654 KB) | HTML

Let N={n0, n1, ... , nk-1} be a set of positive integers and M= {m0, m1, ... , mk-1} be a multiset of positive integers. By an (N, M, w,1; λ)-multilength optical orthogonal code (MLOOC), we mean an MLOOC of autocross correlation value and intracross correlation value one and intercross correlation value λ. The code con... 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