IEEE Transactions on Information Theory

Issue 11 • Nov. 2014

Filter Results

Displaying Results 1 - 25 of 50
  • 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
  • On the Listsize Capacity With Feedback

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

    The listsize capacity of a discrete memoryless channel is the largest transmission rate for which the expectation-or, more generally, the ρ-th moment-of the number of messages that could have produced the output of the channel approaches one as the blocklength tends to infinity. We show that for channels with feedback, this rate is upper bounded by the maximum of Gallager's E0 fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List Decoding—Random Coding Exponents and Expurgated Exponents

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

    Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list-size L. Two asymptotic regimes are considered, the fixed list-size regime, where L is fixed independently of the block length n, and exponential list size, where L grows exponentially with n. We first derive a general upper bound on the list-decoding average er... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achievability Proof via Output Statistics of Random Binning

    Publication Year: 2014, Page(s):6760 - 6786
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1253 KB) | HTML iconHTML

    This paper introduces a new and ubiquitous framework for establishing achievability results in network information theory problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and strong secrecy pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically Optimal Decision Rules for Joint Detection and Source Coding

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

    The problem of joint detection and lossless source coding is considered. We derive asymptotically optimal decision rules for deciding whether or not a sequence of observations has emerged from a desired information source, and to compress it if has. In particular, our decision rules asymptotically minimize the cost of compression in the case that the data have been classified as desirable, subject... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-Error Capacity of a Class of Timing Channels

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

    We analyze the problem of zero-error communication through timing channels that can be interpreted as discrete-time queues with bounded waiting times. The channel model includes the following assumptions: 1) time is slotted; 2) at most N particles are sent in each time slot; 3) every particle is delayed in the channel for a number of slots chosen randomly from the set {0, 1, ... , K}; and 4) the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Conditional Rényi Entropy

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

    The Rényi entropy of general order unifies the well-known Shannon entropy with several other entropy notions, like the min-entropy or collision entropy. In contrast to the Shannon entropy, there seems to be no commonly accepted definition for the conditional Rényi entropy: several versions have been proposed and used in the literature. In this paper, we reconsider the definition fo... View full abstract»

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

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

    Information theoretical inequalities have strong ties with polymatroids and their representability. A polymatroid is entropic if its rank function is given by the Shannon entropy of the subsets of some discrete random variables. The book is a special iterated adhesive extension of a polymatroid with the property that entropic polymatroids have n-page book extensions over an arbitrary spine. We pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability and Secrecy Functions of the Wiretap Channel Under Cost Constraint

    Publication Year: 2014, Page(s):6819 - 6843
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1340 KB) | HTML iconHTML

    The wiretap channel has been devised and studied first by Wyner, and subsequently extended to the case with nondegraded general wiretap channels by Csiszár and Körner. Focusing mainly on the stationary memoryless channel with cost constraint, we newly introduce the notion of reliability and secrecy functions as a fundamental tool to analyze and/or design the performance of an effic... View full abstract»

    Open Access
  • MIMO Wiretap Channels With Unknown and Varying Eavesdropper Channel States

    Publication Year: 2014, Page(s):6844 - 6869
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (975 KB) | HTML iconHTML

    In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel state is completely unknown to the legitimate parties. In particular, a Gaussian MIMO wiretap channel is considered, where the eavesdropper channel state can vary from one channel use to the next, and the overall channel state sequence is known only to the eavesdropper. When the eavesdroppe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Outer Bound for the Vector Gaussian CEO Problem

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

    We study the vector Gaussian CEO problem, where there are arbitrary number of agents, each having a noisy observation of a vector Gaussian source. The goal of the agents is to describe the source to a central unit, which wants to reconstruct the source within a given distortion. The rate-distortion region of the vector Gaussian CEO problem is unknown in general. Here, we provide an outer bound for... View full abstract»

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

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

    The model of a side information vending machine (VM) accounts for scenarios in which the measurement of side information sequences can be controlled via the selection of cost-constrained actions. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information VM is available at the intermediate and/or end node of the cascade. A single-letter char... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information Embedding on Actions

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

    The problem of optimal actuation for channel and source coding was recently formulated and solved in a number of relevant scenarios. In this class of models, actions are taken at encoders or decoders, either to acquire side information in an efficient way or to control or probe effectively the channel state. In this paper, the problem of embedding information on the actions is studied for both the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources

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

    We study the Lempel-Ziv'78 algorithm and show that its (normalized) redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper, in particular, by presenting a new simplified proof of the central limit theorem (CLT) for the number of phrases in the LZ'78 algorithm. We first analyze the asymptotic behavior of the total path len... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-Delay and Causal Single-User and Multi-User Lossy Source Coding with Decoder Side Information

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

    We consider zero-delay, single-user, and multi-user source coding with an average distortion constraint and decoder side information. The zero-delay constraint translates into causal (sequential) encoder and decoder pairs as well as the use of instantaneous codes. For the single-user setting, we show that optimal performance is attained by time sharing at most two scalar encoder-decoder pairs, tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions

    Publication Year: 2014, Page(s):6943 - 6965
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (838 KB) | HTML iconHTML

    Low-density parity-check (LDPC) convolutional codes (or spatially coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is now called threshold saturation via spatial coupling. This new phenomenon is characterized by the belief-propagation threshold of the spatial... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Bounds on the Finite Length Scaling of Polar Codes

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

    Improved upper bounds on the blocklength required to communicate over binary-input channels using polar codes, below some given error probability, are derived. For that purpose, an improved bound on the number of non-polarizing channels is obtained. The main result is that the blocklength required to communicate reliably scales at most as O((I(W ) - R)-5.702), where R is the code rate a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Repair Locality With Multiple Erasure Tolerance

    Publication Year: 2014, Page(s):6979 - 6987
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (782 KB) | HTML iconHTML

    In distributed storage systems, erasure codes with locality r are preferred because a coordinate can be locally repaired by accessing at most r other coordinates which in turn greatly reduces the disk I/O complexity for small r. However, the local repair may not be performed when some of the r coordinates are also erased. To overcome this problem, we propose the (r, δ)c-locality ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Coding-Theoretic Application of Baranyai’s Theorem

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

    Baranyai's theorem is well known in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all u-subsets of an n-element set into (n-1;u-1) subfamilies such that each subfamily forms a partition of the n-element set, where n is divisible by u. In this paper, we present a coding-theoretic application of Baranyai's theorem. More precisely, we propose a combi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes Between MBR and MSR Points With Exact Repair Property

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

    In this paper, distributed storage systems with exact repair are studied. Constructions for exact-regenerating codes between the minimum storage regenerating (MSR) and the minimum bandwidth regenerating (MBR) points are given. To the best of our knowledge, no previous construction of exact-regenerating codes between MBR and MSR points is done except in the works by Tian et al. and Sasidharan et al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High Sum-Rate Three-Write and Nonbinary WOM Codes

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

    Write-once memory (WOM) is a storage medium with memory elements, called cells, which can take on q levels. Each cell is initially in level 0 and can only increase its level. A t-write WOM code is a coding scheme, which allows one to store t messages to the WOM such that on consecutive writes every cell's level does not decrease. The sum-rate of the WOM code, which is the ratio between the total a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions of Snake-in-the-Box Codes for Rank Modulation

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

    Snake-in-the-box code is a Gray code, which is capable of detecting a single error. Gray codes are important in the context of the rank modulation scheme, which was suggested recently for representing information in flash memories. For a Gray code in this scheme, the codewords are permutations, two consecutive codewords are obtained using the push-to-the-top operation, and distance measure is defi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions

    Publication Year: 2014, Page(s):7026 - 7034
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (589 KB) | HTML iconHTML

    We introduce the class of multiply constant-weight codes to improve the reliability of certain physically unclonable function response, and extend classical coding methods to construct multiply constant-weight codes from known \(q\) -ary and constant-weight codes. We derive analogs of Johnson bounds and give constructions showing these bounds to be asymptotically tight up to a constant factor unde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes

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

    For a growing number of applications, such as cellular, peer-to-peer, and sensor networks, efficient error-free transmission of data through a network is essential. Toward this end, Kötter and Kschischang propose the use of subspace codes to provide error correction in the network coding context. The primary construction for subspace codes is the lifting of rank-metric or matrix codes, a p... 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