IEEE Transactions on Information Theory

Issue 2 • Feb. 2016

Filter Results

Displaying Results 1 - 25 of 36
  • Table of contents

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

    Publication Year: 2016, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • Information Retrieval With Varying Number of Input Clues

    Publication Year: 2016, Page(s):625 - 638
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    Information retrieval in associative memories was studied in a recent paper by Yaakobi and Bruck (2012). Associations between memory entries give us the t-neighbourhood of an entry. In their model, an information unit is retrieved from the memory with the aid of input clues, which are chosen from a reference set. In this paper, we consider the situation where the information unit is found unambigu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes for Partially Stuck-At Memory Cells

    Publication Year: 2016, Page(s):639 - 654
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (690 KB) | HTML iconHTML

    In this paper, we study a new model of defect memory cells, called partially stuck-at memory cells, which is motivated by the behavior of multi-level cells in non-volatile memories, such as flash memories and phase change memories. If a cell can store the q levels 0, 1,... ,q - 1, we say that it is partially stuck-at level s, where 1 ≤ s ≤ q -1, if it can only store values, which are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Apparent Distance and a Notion of BCH Multivariate Codes

    Publication Year: 2016, Page(s):655 - 668
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    This paper is devoted to studying two main problems: 1) computing the apparent distance of an Abelian code and 2) giving a notion of Bose, Ray-Chaudhuri, Hocquenghem (BCH) multivariate code. To do this, we first strengthen the notion of an apparent distance by introducing the notion of a strong apparent distance; then, we present an algorithm to compute the strong apparent distance of an Abelian c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum Distance Separable 2D Convolutional Codes

    Publication Year: 2016, Page(s):669 - 680
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (355 KB) | HTML iconHTML

    Maximum distance separable (MDS) block codes and MDS 1D convolutional codes are the most robust codes for error correction within the class of block codes of a fixed rate and 1D convolutional codes of a certain rate and degree, respectively. In this paper, we generalize this concept to the class of 2D convolutional codes. For that, we introduce a natural bound on the distance of a 2D convolutional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-Point AG Codes on the GK Maximal Curves

    Publication Year: 2016, Page(s):681 - 686
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (330 KB) | HTML iconHTML

    We determine the Weierstrass semigroup of a pair of certain rational points on the Giulietti-Korchmáros maximal curves. We use this semigroup to obtain two-point algebraic geometric (AG) codes with better parameters than comparable one-point AG codes arising from these curves. These parameters are new records in the MinT's tables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ranks and Kernels of Codes From Generalized Hadamard Matrices

    Publication Year: 2016, Page(s):687 - 694
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    The ranks and kernels of generalized Hadamard matrices are studied. It is proved that any generalized Hadamard matrix H(q, λ) over Fq, q > 3, or q = 3 and gcd(3, λ) ≠ 1, generates a self-orthogonal code. This result puts a natural upper bound on the rank of the generalized Hadamard matrices. Lower and upper bounds are given for the dimension of the kernel of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the List Decodability of Burst Errors

    Publication Year: 2016, Page(s):695 - 702
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (205 KB) | HTML iconHTML

    Burst errors are a type of distortion in many data communications and data storage channels. In this paper, we consider the list decodability of codes for single burst error case and phased-burst error case independently. Firstly, we analyze the list decodability of random codes, and we show that the burst list decoding radius and the rate of random codes achieve the Singleton bound and the Gilber... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds for Permutation Rate-Distortion

    Publication Year: 2016, Page(s):703 - 712
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (551 KB) | HTML iconHTML

    We study the rate-distortion relationship in the set of permutations endowed with the Kendall τ-metric and the Chebyshev metric (the ℓ∞-metric). This paper is motivated by the application of permutation rate-distortion to the average-case and worst-case distortion analysis of algorithms for ranking with incomplete information and approximate sorting algorithms. For ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Turbo Quantization of Oversampled Signals

    Publication Year: 2016, Page(s):713 - 723
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (674 KB) | HTML iconHTML

    We present a new iterative quantization procedure for oversampled frames with guaranteed convergence and stability. The procedure uses similar concepts to that of turbo decoding in the context of error control coding. The quantization process is modeled as a quadratic integer-programming problem. A trellis structure is introduced to solve the problem, where the quantized coefficients represent a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Design of Optimal Noisy Channel Scalar Quantizer with Random Index Assignment

    Publication Year: 2016, Page(s):724 - 735
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    The general approach in a noisy channel scalar quantizer design is an iterative descent algorithm, which guarantees only a locally optimal solution. While sufficient conditions under which the local optimum becomes a global optimum are known in the noiseless channel case, such sufficient conditions were not derived for the noisy counterpart. Moreover, efficient globally optimal design techniques f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Source-Channel Coding With Time-Varying Channel and Side-Information

    Publication Year: 2016, Page(s):736 - 753
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1167 KB) | HTML iconHTML

    Transmission of a Gaussian source over a time-varying Gaussian channel is studied in the presence of time-varying correlated side information at the receiver. A block fading model is considered for both the channel and the side information, whose states are assumed to be known only at the receiver. The optimality of separate source and channel coding in terms of average end-to-end distortion is sh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lossy Source Coding Interpretation of Wyner’s Common Information

    Publication Year: 2016, Page(s):754 - 768
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (574 KB) | HTML iconHTML

    Wyner's common information was originally defined for a pair of dependent discrete random variables. Its significance is largely reflected in, and also confined to, several existing interpretations in various source coding problems. This paper attempts to expand its practical significance by providing a new operational interpretation. In the context of the Gray-Wyner network, it is established tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial Message Sharing and a New Achievable Region for Multiple Descriptions

    Publication Year: 2016, Page(s):769 - 792
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (974 KB) | HTML iconHTML

    This paper presents a new achievable rate-distortion region for the general L channel multiple descriptions (MDs) problem. A well-known general region for this problem is due to Venkataramani, Kramer, and Goyal (VKG). Their encoding scheme is an extension of the El Gamal-Cover (EC) and Zhang-Berger (ZB) coding schemes to the L channel case and includes a combinatorial number of refinement codebook... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Capacity of Channels With Timing Synchronization Errors

    Publication Year: 2016, Page(s):793 - 810
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1174 KB) | HTML iconHTML

    We consider a new formulation of a class of synchronization error channels and derive analytical bounds and numerical estimates for the capacity of these channels. For the binary channel with only deletions, we obtain an expression for the symmetric information rate in terms of subsequence weights, which reduces to a tight lower bound for small deletion probabilities. We are also able to exactly c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Capacity of String-Duplication Systems

    Publication Year: 2016, Page(s):811 - 824
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    It is known that the majority of the human genome consists of duplicated sequences. Furthermore, it is believed that a significant part of the rest of the genome also originated from duplicated sequences and has mutated to its current form. In this paper, we investigate the possibility of constructing an exponentially large number of sequences from a short initial sequence using simple duplication... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple Access Channels With Combined Cooperation and Partial Cribbing

    Publication Year: 2016, Page(s):825 - 848
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1663 KB) | HTML iconHTML

    In this paper, the multiple access channel (MAC) with combined cooperation and partial cribbing is studied, and its capacity region is characterized. Cooperation means that each of the two encoders sends a message to the other via a rate-limited link prior to transmission, while partial cribbing means that each of the two encoders obtains a deterministic function of the other encoder's output with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fundamental Limits of Caching in Wireless D2D Networks

    Publication Year: 2016, Page(s):849 - 869
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1119 KB) | HTML iconHTML

    We consider a wireless device-to-device (D2D) network where communication is restricted to be single-hop. Users make arbitrary requests from a finite library of files and have pre-cached information on their devices, subject to a per-node storage capacity constraint. A similar problem has already been considered in an infrastructure setting, where all users receive a common multicast (coded) messa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicasting in Linear Deterministic Relay Network by Matrix Completion

    Publication Year: 2016, Page(s):870 - 875
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (531 KB) | HTML iconHTML

    We provide a deterministic polynomial time algorithm for multicasting in a linear deterministic relay network and a wireless communication framework proposed by Avestimehr et al. The running time of our algorithm is faster than existing ones and matches the current best complexity of unicast computations for each sink. Our approach is based on the polylinking flow model of Goemans et al. and the m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution

    Publication Year: 2016, Page(s):876 - 890
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (359 KB) | HTML iconHTML

    John Bell has shown that the correlations entailed by quantum mechanics cannot be reproduced by a classical process involving non-communicating parties. But can they be simulated with the help of bounded communication? This problem has been studied for more than two decades, and it is now well understood in the case of bipartite entanglement. However, the issue was still widely open for multiparti... View full abstract»

    Open Access
  • No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovász Number

    Publication Year: 2016, Page(s):891 - 914
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (689 KB) | HTML iconHTML

    We study the one-shot zero-error classical capacity of a quantum channel assisted by quantum no-signalling correlations, and the reverse problem of exact simulation of a prescribed channel by a noiseless classical one. Quantum no-signalling correlations are viewed as two-input and two-output completely positive and trace preserving maps with linear constraints enforcing that the device cannot sign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polar Codes in Network Quantum Information Theory

    Publication Year: 2016, Page(s):915 - 924
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    Polar coding is a method for communication over noisy classical channels, which is provably capacity achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information processing, for tasks such as classical communication, private classical communication, and quantum communication. In this paper, we apply the polar coding method to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Optimal Noise-Adding Mechanism in Differential Privacy

    Publication Year: 2016, Page(s):925 - 951
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1133 KB) | HTML iconHTML

    Differential privacy is a framework to quantify to what extent individual privacy in a statistical database is preserved while releasing useful aggregate information about the database. In this paper, within the classes of mechanisms oblivious of the database and the queriesqueries beyond the global sensitivity, we characterize the fundamental tradeoff between privacy and utility in differential p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Noise Adding Mechanisms for Approximate Differential Privacy

    Publication Year: 2016, Page(s):952 - 969
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB) | HTML iconHTML

    We study the (nearly) optimal mechanisms in (ϵ, δ)-differential privacy for integer-valued query functions and vector-valued (histogram-like) query functions under a utility-maximization/cost-minimization framework. Within the classes of mechanisms oblivious of the database and the queries beyond the global sensitivity, we characterize the tradeoff between ϵ and δ in ut... 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