IEEE Transactions on Information Theory

Issue 8 • Aug. 2015

Filter Results

Displaying Results 1 - 25 of 33
  • Table of contents

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

    Publication Year: 2015, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (141 KB)
    Freely Available from IEEE
  • Wave-Like Solutions of General 1-D Spatially Coupled Systems

    Publication Year: 2015, Page(s):4117 - 4157
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1577 KB) | HTML iconHTML

    We establish the existence of wave-like solutions to spatially coupled graphical models which, in the large size limit, can be characterized by a 1-D real-valued state. This is extended to a proof of the threshold saturation phenomenon for all such models, which includes spatially coupled irregular low-density parity-check codes over the binary erasure channel (BEC), but also addresses hard-decisi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Coset Leader Graphs of LDPC Codes

    Publication Year: 2015, Page(s):4158 - 4163
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB) | HTML iconHTML

    Our main technical result is that, in the coset leader graph of a linear binary code of block length n, the metric balls spanned by constant-weight vectors grow exponentially slower than those in (0, 11n. Following the approach of Friedman and Tillich, we use this fact to improve on the first linear programming bound on the rate of low-density parity check (LDPC) codes, as the function of their mi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Fractional Repetition Codes Based on Graphs and Designs

    Publication Year: 2015, Page(s):4164 - 4180
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (838 KB) | HTML iconHTML

    Fractional repetition (FR) codes is a family of codes for distributed storage systems (DSSs) that allow for uncoded exact repairs having the minimum repair bandwidth. However, in contrast to minimum bandwidth regenerating (MBR) codes, where an arbitrary set of a certain size of available nodes is used for a node repair, the repairs with FR codes are table based. This usually allows to store more d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Streaming Codes for Multicast Over Burst Erasure Channels

    Publication Year: 2015, Page(s):4181 - 4208
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2428 KB) | HTML iconHTML

    We study low-delay erasure correction codes in a real-time streaming setup. The encoder observes a stream of source packets and outputs the channel packets in a causal fashion, which are broadcast to two receivers over burst-erasure channels. Each receiver must decode the source packets sequentially with a deadline of Ti, while its channel can introduce an erasure burst of maximum lengt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rank-Modulation Rewrite Coding for Flash Memories

    Publication Year: 2015, Page(s):4209 - 4226
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    The current flash memory technology focuses on the cost minimization of its static storage capacity. However, the resulting approach supports a relatively small number of program-erase cycles. This technology is effective for consumer devices (e.g., smartphones and cameras) where the number of program-erase cycles is small. However, it is not economical for enterprise storage systems that require ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Bounds and Constructions for Granular Media Coding

    Publication Year: 2015, Page(s):4227 - 4238
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1118 KB) | HTML iconHTML

    Improved lower and upper bounds on the size and the rate of grain-correcting codes are presented. The lower bound is Gilbert-Varshamov-like combined with a construction by Gabrys et al., and it improves on the previously best known lower bounds on the asymptotic rate of ⌈τn⌉-grain-correcting codes of length n on the interval [0, 0.0668]. One of the two newly presented upper bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Construction of Block Codes From Algebraic Curves

    Publication Year: 2015, Page(s):4239 - 4242
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (151 KB) | HTML iconHTML

    Since discovery of Goppa geometric codes, people have been asking the question: are there different constructions of block codes from algebraic curves that give the same parameters as Goppa geometric codes. Despite of great effort by researchers, no such constructions have been found so far. Although in literature, there are many constructions of block code from algebraic curves, most of them are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fourth Power Residue Double Circulant Self-Dual Codes

    Publication Year: 2015, Page(s):4243 - 4252
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (613 KB) | HTML iconHTML

    Quadratic residue codes are a well-known class of codes. In this paper, we consider the constructions of self-dual codes by higher power residues, especially fourth power residues. New infinite families of self-dual codes over GF(2), GF(3), GF(4), GF(8), and GF(9) are introduced. Some of them have better minimum weight than previously known codes. We also give general results related to the automo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of Binary Self-Dual Codes of Length 40

    Publication Year: 2015, Page(s):4253 - 4258
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (577 KB) | HTML iconHTML

    An efficient isomorph-free generation algorithm for classification of binary self-dual codes with the minimum distance d = 4 is presented. It is combined with another isomorph-free generation algorithm for classification of self-dual codes with the minimum distance d ≥ 6. A complete classification of all binary self-dual codes of length 40 is given as a result. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes

    Publication Year: 2015, Page(s):4259 - 4268
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1684 KB) | HTML iconHTML

    A 1-perfect code of a graph G is a set C ⊆ V(G) such that the 1-balls centered at the vertices in C constitute a partition of V(G). In this paper, we consider the dual-cube D Qm that is a connected (m + 1)-regular spanning subgraph of the hypercube Q2m+1, and show that it admits a 1-perfect code if and only if m = 2k - 2, k ≥ 2. The result closely par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple Object Identification Coding

    Publication Year: 2015, Page(s):4269 - 4276
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (209 KB) | HTML iconHTML

    In the case of ordinary identification coding, a code is devised to identify a single object among N objects. But, in this paper, we consider a coding problem to identify K objects at once among N objects in the both cases that K objects are ranked or not ranked. By combining Moulin-Koetter scheme with the ε-almost strongly universal class of hash functions used in Kurosawa-Yoshida scheme, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extremality for Gallager’s Reliability Function $E_{0}$

    Publication Year: 2015, Page(s):4277 - 4292
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (583 KB) | HTML iconHTML

    We describe certain extremalities for Gallager's E0 function evaluated under the uniform input distribution over the class of binary input discrete memoryless channels; The results characterize the extremality of the E0(ρ) curves of the binary erasure channel and the binary symmetric channel among all the E0(ρ) curves that can be generated by the clas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Ziv–Zakai–Rényi Bound for Joint Source-Channel Coding

    Publication Year: 2015, Page(s):4293 - 4315
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2175 KB) | HTML iconHTML

    Shannon's capacity and rate-distortion function, combined with the separation principle, provide tight bounds for the minimum possible distortion in joint source-channel coding. These bounds, however, are usually achievable only in the limit of a large block length. In their 1973 paper, Ziv and Zakai introduced a family of alternative capacity and rate-distortion functions, based on functionals sa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable-Length Compression Allowing Errors

    Publication Year: 2015, Page(s):4316 - 4330
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    This paper studies the fundamental limits of the minimum average length of lossless and lossy variable-length compression, allowing a nonzero error probability ε, for lossless compression. We give nonasymptotic bounds on the minimum average length in terms of Erokhin's rate-distortion function and we use those bounds to obtain a Gaussian approximation on the speed of approach to the limit, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Zero-Delay Jamming Over an Additive Noise Channel

    Publication Year: 2015, Page(s):4331 - 4344
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (427 KB) | HTML iconHTML

    This paper considers the problem of optimal zero-delay jamming over an additive noise channel. Building on a sequence of recent results on conditions for linearity of optimal estimation, and of optimal mappings in source-channel coding, the saddle-point solution to the jamming problem is derived for general sources and channels, without recourse to Gaussianity assumptions. The linearity conditions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Two-User MISO Broadcast Channel With Alternating CSIT: A Topological Perspective

    Publication Year: 2015, Page(s):4345 - 4366
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1139 KB) | HTML iconHTML

    In many wireless networks, link strengths are affected by many topological factors, such as different distances, shadowing, and intercell interference, thus resulting in some links being generally stronger than other links. From an information theoretic point of view, accounting for such topological aspects is still a novel approach, that has been recently fueled by strong indications that such as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference and X Networks With Noisy Cooperation and Feedback

    Publication Year: 2015, Page(s):4367 - 4389
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2073 KB) | HTML iconHTML

    The Gaussian K-user interference and M × K X channels are investigated with no instantaneous channel state information at transmitters (CSIT). First, it is assumed that the CSI is fed back to all nodes after a finite delay (delayed CSIT), and furthermore, the transmitters operate in full-duplex mode, i.e, they can transmit and receive simultaneously. Achievable results on the degrees of fre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy Efficient Neurons With Generalized Inverse Gaussian Conditional and Marginal Hitting Times

    Publication Year: 2015, Page(s):4390 - 4398
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    Neuronal information processing is energetically costly. Energy supply restrictions on information processing have resulted in the evolution of brains to compute and communicate information with remarkable energy efficiency. Indeed, energy minimization subject to functional constraints is a unifying principle. Toward better comprehension of neuronal information processing and communication from an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation of Nonnegative Systems by Finite Impulse Response Convolutions

    Publication Year: 2015, Page(s):4399 - 4409
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB) | HTML iconHTML

    We pose the deterministic, nonparametric, approximation problem for scalar nonnegative input/output systems via finite impulse response convolutions, based on repeated observations of input/output signal pairs. The problem is converted into a nonnegative matrix factorization with special structure for which we useCsiszár's I-divergenceas the criterion of optimality. Conditions are given, o... View full abstract»

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

    Publication Year: 2015, Page(s):4410 - 4423
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (606 KB) | HTML iconHTML

    Scalable frames are frames with the property that the frame vectors can be rescaled resulting in tight frames. However, if a frame is not scalable, one has to aim for an approximate procedure. For this, in this paper we introduce three novel quantitative measures of the closeness to scalability for frames in finite dimensional real Euclidean spaces. Besides the natural measure of scalability given... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weighted $ell _{1}$ -Minimization for Generalized Non-Uniform Sparse Model

    Publication Year: 2015, Page(s):4424 - 4439
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (806 KB) | HTML iconHTML

    Model-based compressed sensing refers to compressed sensing with extra structure about the underlying sparse signal known a priori. Recent work has demonstrated that both for deterministic and probabilistic models imposed on the signal, this extra information can be successfully exploited to enhance recovery performance. In particular, weighted ℓ1-minimization with suitable choic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Restricted Isometry Property of Random Subdictionaries

    Publication Year: 2015, Page(s):4440 - 4450
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    We study statistical restricted isometry, a property closely related to sparse signal recovery, of deterministic sensing matrices of size m × N. A matrix is said to have a statistical restricted isometry property (StRIP) of order k if most submatrices with k columns define a near-isometric map of Rk into Rm. As our main result, we establish sufficient conditions for the StRIP property of a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence of Gradient Descent for Low-Rank Matrix Approximation

    Publication Year: 2015, Page(s):4451 - 4457
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    This paper provides a proof of global convergence of gradient search for low-rank matrix approximation. Such approximations have recently been of interest for large-scale problems, as well as for dictionary learning for sparse signal representations and matrix completion. The proof is based on the interpretation of the problem as an optimization on the Grassmann manifold and Fubiny-Study distance ... 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