By Topic

IEEE Transactions on Information Theory

Issue 6 • June 2014

Filter Results

Displaying Results 1 - 25 of 42
  • Table of contents

    Publication Year: 2014, Page(s):C1 - C4
    Request permission for commercial reuse | PDF file iconPDF (174 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
  • Catalytic Quantum Error Correction

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

    We develop the theory of entanglement-assisted quantum error-correcting (EAQEC) codes, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to preshared entanglement. Conventional stabilizer codes are equivalent to self-orthogonal symplectic codes. In contrast, EAQEC codes do not require self-orthogonality, which greatly simplifies their construc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polar Codes for Private and Quantum Communication Over Arbitrary Channels

    Publication Year: 2014, Page(s):3090 - 3103
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (307 KB) | HTML iconHTML

    We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information, and in the latter, the symmetric private information. Both schemes are built from a polar coding construction capable of transmitting classical information over a quantum channel. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fidelity Lower Bounds for Stabilizer and CSS Quantum Codes

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

    In this paper, we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite length stabilizer and CSS codes. We use the average quantum enumerators for obtaining lower bounds on the average fidelity of these ensembles. We further improve ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concatenated Quantum Codes Can Attain the Quantum Gilbert–Varshamov Bound

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

    A family of quantum codes of increasing block length with positive rate is asymptotically good if the ratio of its distance to its block length approaches a positive constant. The asymptotic quantum Gilbert-Varshamov (GV) bound states that there exist q -ary quantum codes of sufficiently long block length N having fixed rate R with distance at least NH-1((1-R)/2), where Hq2 i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Efficiency of Classical and Quantum Secure Function Evaluation

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

    We provide bounds on the efficiency of secure one-sided output two-party computation of arbitrary finite functions from trusted distributed randomness in the statistical case. From these results, we derive bounds on the efficiency of protocols that use different variants of oblivious transfer (OT) as a black box. When applied to implementations of OT, these bounds generalize most known results to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Porosity of Additive Noise Channels

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

    Consider a binary modulo-additive noise channel with noiseless feedback. When the noise is a stationary and ergodic process Z, the capacity is 1- H(Z) (H(·) denoting the entropy rate). It is shown analogously that when the noise is a deterministic sequence z, the capacity under finite-state encoding and decoding is 1 - ρ̅(z), where ρ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polar Decomposition of Mutual Information Over Complex-Valued Channels

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

    A polar decomposition of mutual information between a complex-valued channel's input and output is proposed for an input whose amplitude and phase are independent of each other. The mutual information is symmetrically decomposed into three terms: 1) an amplitude term; 2) a phase term; and 3) a cross term, where the cross term is negligible. Theoretical bounds of the amplitude and phase terms are d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum KL-Divergence on Complements of L_{1} Balls

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

    Pinsker's widely used inequality upper-bounds the total variation distance ∥P - Q∥1 in terms of the Kullback-Leibler divergence D(P∥Q). Although, in general, a bound in the reverse direction is impossible, in many applications the quantity of interest is actually D*(v, Q)-defined, for an arbitrary fixed Q, as the infimum of D(P∥Q) over all distributions P tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Capacity of Memoryless Rewritable Storage Channels

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

    A number of modern storage technologies, when written to, exhibit substantial variability in the outcome of a write action. It is possible to mitigate the effect of the write uncertainty through the use of a feedback loop that rewrites the memory whenever judged necessary, in effect reshaping the write noise. This scheme highlights a tradeoff between the storage capacity of the memory and the cost... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context Tree Estimation in Variable Length Hidden Markov Models

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

    We address the issue of context tree estimation in variable length hidden Markov models. We propose an estimator of the context tree of the hidden Markov process, which needs no prior upper bound on the depth of the context tree. We prove that the estimator is strongly consistent. This uses information-theoretic mixture inequalities in the spirit of the literatures of Finesso, and Gassiat and Bouc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions

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

    This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be ... View full abstract»

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

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

    The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder-to whom the side information is unavailable-be able to compute the decoder's reconstruction sequence to within some distortion. For discrete memoryless sources and finite single-letter distortion measures, an expression is given for the minimal description rate as a function of the jo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Lossy Common Information of Correlated Sources

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

    The two most prevalent notions of common information (CI) are due to Wyner and Gács-Körner and both the notions can be stated as two different characteristic points in the lossless Gray-Wyner region. Although the information theoretic characterizations for these two CI quantities can be easily evaluated for random variables with infinite entropy (e.g., continuous random variables),... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossy Compression via Sparse Linear Regression: Performance Under Minimum-Distance Encoding

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

    We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a design matrix. Called a sparse superposition or sparse regression codebook, this structure is motivated by an analogous construction proposed recently by Barron a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding

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

    We propose computationally efficient encoders and decoders for lossy compression using a sparse regression code. The codebook is defined by a design matrix and codewords are structured linear combinations of columns of this matrix. The proposed encoding algorithm sequentially chooses columns of the design matrix to successively approximate the source sequence. It is shown to achieve the optimal di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LDPC Codes for 2D Arrays

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

    Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a pure combinatorial erasure model used in traditional array codes, we propose a mixed combinatorial-probabilistic model of limiting the number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generalization of Omura's Decoding Algorithm and a Proof of Convergence

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

    An approximation of maximum-likelihood decoding over the binary symmetric channel was introduced by Omura in 1972. This decoder employs an iterative, randomized algorithm whose behavior closely mimics that of the simplex algorithm. In this paper, we generalize Omura's decoder to operate on an arbitrary binary-input memoryless channel. Further, we prove that the probability of the generalized Omura... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Automorphism Group of a Self-Dual [{72,36,16}] Code Does Not Contain Z_{4}

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

    It has been proven in a series of works that the order of the automorphism group of a self-dual binary [72,36,16] code does not exceed five. Up to equivalence, we obtain a parametrization of all self-dual binary codes of length 72 with automorphism of order four, which can be extremal. We use extensive computations in Magma and on a supercomputer to show that the automorphism group of an extremal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polytope Codes Against Adversaries in Networks

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

    This paper investigates a network coding problem wherein an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than that of an adversary controlling a given number of edges in the network, in that linear codes are insufficient. To solve the node problem, the class of polytope codes is introduced. Polytope codes a... View full abstract»

    Open Access
  • Performance Bounds on a Wiretap Network With Arbitrary Wiretap Sets

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

    Consider a communication network represented by a directed graph G = (V, ε), where V is the set of nodes and 8 is the set of point-to-point channels in the network. On the network, a secure message M is transmitted, and there may exist wiretappers who want to obtain information about the message. In secure network coding, we aim to find a network code, which can protect the message against ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure Degrees of Freedom of One-Hop Wireless Networks

    Publication Year: 2014, Page(s):3359 - 3378
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1378 KB) | HTML iconHTML

    We study the secure degrees of freedom (d.o.f.) of one-hop wireless networks by considering four fundamental wireless network structures: 1) Gaussian wiretap channel; 2) Gaussian broadcast channel with confidential messages; 3) Gaussian interference channel with confidential messages; and 4) Gaussian multiple access wiretap channel. The secrecy capacity of the canonical Gaussian wiretap channel do... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiterminal Secret Key Agreement

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

    The problem of secret key agreement by public discussion is studied under a general multiterminal network, where each user can both send and receive over a private channel. Single-letter upper and lower bounds are for the maximum achievable key rate. The bounds are shown to match for a large class of private channels. A counter-example shows that the bounds do not match in general, and a better co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assisted Common Information With an Application to Secure Two-Party Sampling

    Publication Year: 2014, Page(s):3413 - 3434
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1098 KB) | HTML iconHTML

    An important subclass of secure multiparty computation is secure sampling: two parties output samples of a pair of jointly distributed random variables such that neither party learns more about the other party's output than what its own output reveals. The parties make use of a setup - correlated random variables with a different distribution - as well as unlimited noiseless communication. An uppe... 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
Frank R. Kschischang

Department of Electrical and Computer Engineering