Scheduled System Maintenance
On Tuesday, September 26, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Issue 9 • Sept. 2014

Filter Results

Displaying Results 1 - 25 of 53
  • Table of contents

    Publication Year: 2014, Page(s):C1 - C4
    Request permission for commercial reuse | PDF file iconPDF (169 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2014, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • Encoding Tasks and Rényi Entropy

    Publication Year: 2014, Page(s):5065 - 5076
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB) | HTML iconHTML

    A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum pth moment of the number of performed tasks are derived. The case where a sequence of tasks is produced by a source and n tasks are jointly described using nR bits is considered. If R is larger than the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding

    Publication Year: 2014, Page(s):5077 - 5094
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB) | HTML iconHTML

    We consider the problem of coded communication, where in each time frame, the transmitter is either silent or transmits a codeword from a given (randomly selected) codebook. The task of the decoder is to decide whether transmission has taken place, and if so, to decode the message. We derive the optimum detection/decoding rule in the sense of the best tradeoff among the probabilities of decoding e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Exponent for Multiple-Access Channels: Lower Bounds

    Publication Year: 2014, Page(s):5095 - 5115
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (698 KB) | HTML iconHTML

    A unified approach is presented for the derivation of reliability function lower bounds for the two-user discrete memoryless (DM) multiple-access channel (MAC). In particular, three lower bounds are presented. The first one (random coding) is identical to the best known lower bound on the reliability function of DM-MACs. It is shown that the random coding bound characterizes the performance of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond the Entropy Power Inequality, via Rearrangements

    Publication Year: 2014, Page(s):5116 - 5137
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (442 KB) | HTML iconHTML

    A lower bound on the Rényi differential entropy of a sum of independent random vectors is demonstrated in terms of rearrangements. For the special case of Boltzmann-Shannon entropy, this lower bound is better than that given by the entropy power inequality. Several applications are discussed, including a new proof of the classical entropy power inequality and an entropy inequality involvin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity and Coding for the Ising Channel With Feedback

    Publication Year: 2014, Page(s):5138 - 5149
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1450 KB) | HTML iconHTML

    The Ising channel, which was introduced in 1990, is a channel with memory that models intersymbol interference. In this paper, we consider the Ising channel with feedback and find the capacity of the channel together with a capacity-achieving coding scheme. To calculate the channel capacity, an equivalent dynamic programming (DP) problem is formulated and solved. Using the DP solution, we establis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • To Feed or Not to Feedback

    Publication Year: 2014, Page(s):5150 - 5172
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1083 KB) | HTML iconHTML

    We study communication over finite state channels (FSCs), where the encoder and the decoder can control the availability or the quality of noise-free feedback, which is fed back from the decoder to the encoder. Specifically, the instantaneous feedback is a function of an action taken by the encoder, an action taken by the decoder, and the channel output. Encoder and decoder actions take values fro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Private Broadcasting Over Independent Parallel Channels

    Publication Year: 2014, Page(s):5173 - 5187
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (783 KB) | HTML iconHTML

    We study broadcasting of two confidential messages to two groups of receivers over independent parallel subchannels. One group consists of an arbitrary number of receivers, interested in a common message, whereas the other group has only one receiver. Each message must be confidential from the receiver(s) in the other group. Each of the subchannels is assumed to be degraded in a certain fashion. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes

    Publication Year: 2014, Page(s):5188 - 5203
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4169 KB) | HTML iconHTML

    In this paper, we study the graphical structure of elementary trapping sets (ETSs) of variable-regular low-density parity-check (LDPC) codes. ETSs are known to be the main cause of error floor in LDPC coding schemes. For the set of LDPC codes with a given variable node degree dl and girth g, we identify all the nonisomorphic structures of an arbitrary class of (a, b) ETSs, where a is the number of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes

    Publication Year: 2014, Page(s):5204 - 5214
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (511 KB) | HTML iconHTML

    In this paper, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m q. In the literature, the minimum/stopping distance of these codes (denoted by d(q, m) and h(q, m), respectively) has been thoroughly studied for m 5. Both exact results, for small value... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pseudocodewords of Parity-Check Codes Over Fields of Prime Cardinality

    Publication Year: 2014, Page(s):5215 - 5227
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (470 KB) | HTML iconHTML

    This paper considers pseudocodewords of lowdensity parity-check codes over alphabets with prime cardinality p for use over the p-ary symmetric channel. Pseudocodewords are decoding algorithm outputs that may not be legitimate codewords. Here, we consider pseudocodewords arising from graph cover decoding and linear programming decoding. For codes over the binary alphabet, such pseudocodewords corre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure Cooperative Regenerating Codes for Distributed Storage Systems

    Publication Year: 2014, Page(s):5228 - 5244
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1599 KB) | HTML iconHTML

    Regenerating codes enable trading off repair bandwidth for storage in distributed storage systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may also be subject to multiple simultaneous node failures. Cooperative regenerating codes allow bandwidth efficient repair of multiple simultaneous node failures. This paper analyzes storage syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explicit Maximally Recoverable Codes With Locality

    Publication Year: 2014, Page(s):5245 - 5256
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (278 KB) | HTML iconHTML

    Consider a systematic linear code where some (local) parity symbols depend on few prescribed symbols, whereas other (heavy) parity symbols may depend on all data symbols. Such codes have been studied recently in the context of erasure coding for data storage, where the local parities facilitate fast recovery of any single symbol when it is erased, whereas the heavy parities provide tolerance to a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Bounds on Separable Codes for Multimedia Fingerprinting

    Publication Year: 2014, Page(s):5257 - 5262
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (394 KB) | HTML iconHTML

    Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia contents. Separable codes were introduced to detect colluders taking part in the averaging attack, which is the most feasible approach to perform a collusion attack. In this paper, we provide some improved bounds for the size of separable codes. Using a combinatorial technique named ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List Permutation Invariant Linear Codes: Theory and Applications

    Publication Year: 2014, Page(s):5263 - 5282
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (945 KB) | HTML iconHTML

    The class of q-ary list permutation invariant linear codes is introduced in this paper along with probabilistic arguments that validate their existence when certain conditions are met. The specific class of codes is characterized by an upper bound that is tighter than the generalized Shulman-Feder bound and relies on the distance of the codes' weight distribution to the binomial (multinomial, resp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Higher-Order CIS Codes

    Publication Year: 2014, Page(s):5283 - 5295
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    We introduce complementary information set codes of higher order. A binary linear code of length tk and dimension k is called a complementary information set code of order t (t-CIS code for short) if it has t pairwise disjoint information sets. The duals of such codes permit to reduce the cost of masking cryptographic algorithms against side-channel attacks. As in the case of codes for error corre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generalized Construction of Extended Goppa Codes

    Publication Year: 2014, Page(s):5296 - 5303
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1842 KB) | HTML iconHTML

    We present a generalized construction of extended length Goppa codes. Using this construction, we obtain 71 new codes in finite field Fq for q = 4, 7, 8, 9 with better minimum distance than the previously known codes with the same length and dimension. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irregular MDS Array Codes

    Publication Year: 2014, Page(s):5304 - 5314
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (567 KB) | HTML iconHTML

    In this paper, we extend the concept of maximum-distance separable (MDS) array codes to a larger class of codes, where the array columns contain a variable number of data and parity symbols and the codewords cannot be arranged, in general, in a regular array structure with equal column length. These new codes, named irregular MDS array codes, find applications in problems of distributed data stora... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Covering Sets for Limited-Magnitude Errors

    Publication Year: 2014, Page(s):5315 - 5321
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (197 KB) | HTML iconHTML

    For a set M = {-μ, -μ + 1, ... , λ} \ {0} with nonnegative integers λ, μ <; q not both 0, a subset S of the residue class ring Zq modulo an integer q > 1 is called a (λ, μ; q)-covering set if MS = {ms mod q : m ∈ M, s ∈ S} = Zq. Small covering sets play an important role in codes correcting limited-magnitude... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Batched Sparse Codes

    Publication Year: 2014, Page(s):5322 - 5346
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1539 KB) | HTML iconHTML

    Network coding can significantly improve the transmission rate of communication networks with packet loss compared with routing. However, using network coding usually incurs high computational and storage costs in the network devices and terminals. For example, some network coding schemes require the computational and/or storage capacities of an intermediate network node to increase linearly with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Coding Capacity Regions via Entropy Functions

    Publication Year: 2014, Page(s):5347 - 5374
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (954 KB) | HTML iconHTML

    In this paper, we use entropy functions to characterize the set of rate-capacity tuples achievable with either zero decoding error, or vanishing decoding error, for general network coding problems for acyclic networks. We show that when sources are colocated, the outer bound is tight and the sets of zero-error achievable and vanishing-error achievable rate-capacity tuples are the same. Then, we ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Graph Minor Perspective to Multicast Network Coding

    Publication Year: 2014, Page(s):5375 - 5386
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1259 KB) | HTML iconHTML

    Network coding encourages information coding across a communication network. While the necessity, benefit and complexity of network coding are sensitive to the underlying graph structure of a network, existing theory on network coding often treats the network topology as a black box, focusing on algebraic or information theoretic aspects of the problem. This paper aims at an in-depth examination o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Network Functional Compression

    Publication Year: 2014, Page(s):5387 - 5401
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1015 KB) | HTML iconHTML

    In this paper, we consider different aspects of the problem of compressing for function computation across a network, which we call network functional compression. In network functional compression, computation of a function (or, some functions) of sources located at certain nodes in a network is desired at receiver(s). The rate region of this problem has been considered in the literature under ce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Index Coding—An Interference Alignment Perspective

    Publication Year: 2014, Page(s):5402 - 5432
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2287 KB) | HTML iconHTML

    The index coding problem is studied from an interference alignment perspective providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between the capacity of multiple unicast index coding (where each message is desired by exactly one receiver), and groupcast index coding (where a message can be desired by multiple receive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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