By Topic

Information Theory, IEEE Transactions on

Issue 8 • Date Aug. 2014

Filter Results

Displaying Results 1 - 25 of 43
  • Table of contents

    Publication Year: 2014 , Page(s): C1 - C4
    Save to Project icon | Request Permissions | PDF file iconPDF (172 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2014 , Page(s): C2
    Save to Project icon | Request Permissions | PDF file iconPDF (142 KB)  
    Freely Available from IEEE
  • Moderate Deviations in Channel Coding

    Publication Year: 2014 , Page(s): 4417 - 4426
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (247 KB) |  | HTML iconHTML  

    We consider block codes whose rate converges to the channel capacity with increasing blocklength at a certain speed and examine the best possible decay of the probability of error. For discrete memoryless channels, we prove that a moderate deviation principle holds for all convergence rates between the large deviation and the central limit theorem regimes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Second-Order Coding Rates for Channels With State

    Publication Year: 2014 , Page(s): 4427 - 4448
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (485 KB) |  | HTML iconHTML  

    We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the ε-capacity as well as necessary and sufficient conditions for the strong converse property for such channels when the sequence of channel states is not necessarily stationary, memoryless, or ergodic. We then seek a finer charac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections

    Publication Year: 2014 , Page(s): 4449 - 4462
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (422 KB) |  | HTML iconHTML  

    This paper studies expurgated random-coding bounds and exponents for channel coding with a given (possibly suboptimal) decoding rule. Variations of Gallager's analysis are presented, yielding several asymptotic and nonasymptotic bounds on the error probability for an arbitrary codeword distribution. A simple nonasymptotic bound is shown to attain an exponent of Csiszár and Körner u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Erasure/List Exponents for Slepian–Wolf Decoding

    Publication Year: 2014 , Page(s): 4463 - 4471
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (289 KB) |  | HTML iconHTML  

    We analyze random coding error exponents associated with erasure/list Slepian-Wolf decoding using two different methods and then compare the resulting bounds. The first method follows the well known techniques of Gallager and Forney and the second method is based on a technique of distance enumeration, or more generally, type class enumeration, which is rooted in the statistical mechanics of a dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List Decoding for Arbitrarily Varying Broadcast Channels With Receiver Side Information

    Publication Year: 2014 , Page(s): 4472 - 4487
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (498 KB) |  | HTML iconHTML  

    In this paper, the discrete memoryless arbitrarily varying broadcast channel (AVBC) with receiver side information is studied and its random code and deterministic code capacity regions are derived for the average error criterion. In addition, it is analyzed for deterministic list codes and it is shown that the corresponding list capacity region displays a behavior, which is similar to Ahlswede's ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication With Disturbance Constraints

    Publication Year: 2014 , Page(s): 4488 - 4502
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1198 KB) |  | HTML iconHTML  

    Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding scheme turns out to be the same as the Han-Kobayashi scheme for the two user-pair interference channel. This result is extended to the Gaussian vector (multiple-in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sumset and Inverse Sumset Inequalities for Differential Entropy and Mutual Information

    Publication Year: 2014 , Page(s): 4503 - 4514
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (242 KB) |  | HTML iconHTML  

    The sumset and inverse sumset theories of Freiman, Plünnecke, and Ruzsa, give bounds connecting the cardinality of the sumset A + B = {a + b; a ∈ A, b ∈ B} of two discrete sets A, B, to the cardinalities (or the finer structure) of the original sets A, B. For example, the sum-difference bound of Ruzsa states that, |A + B| |A| |B| |A - B|3, where the difference set ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Which Boolean Functions Maximize Mutual Information on Noisy Inputs?

    Publication Year: 2014 , Page(s): 4515 - 4525
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (499 KB) |  | HTML iconHTML  

    We pose a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let Xn be independent identically distributed Bernoulli(1/2), and let Yn be the result of passing Xn through a memoryless binary symmetric channel with crossover probability α. For any Boolean function b : {0, 1}n ș... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-Memory Prediction as Well as the Empirical Mean

    Publication Year: 2014 , Page(s): 4526 - 4543
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1571 KB) |  | HTML iconHTML  

    The problem of universally predicting an individual continuous sequence using a deterministic finite-state machine (FSM) is considered. The empirical mean is used as a reference as it is the constant that fits a given sequence within a minimal square error. A reasonable prediction performance is the regret, namely the excess square-error over the reference loss. This paper analyzes the tradeoff be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantization of Binary-Input Discrete Memoryless Channels

    Publication Year: 2014 , Page(s): 4544 - 4552
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (706 KB) |  | HTML iconHTML  

    The quantization of the output of a binary-input discrete memoryless channel to a smaller number of levels is considered. An algorithm, which finds an optimal quantizer, in the sense of maximizing mutual information between the channel input and quantizer output is given. This result holds for arbitrary channels, in contrast to previous results for restricted channels or a restricted number of qua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Insufficiency of Linear-Feedback Schemes in Gaussian Broadcast Channels With Common Message

    Publication Year: 2014 , Page(s): 4553 - 4566
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (636 KB) |  | HTML iconHTML  

    We consider the K ≥ 2-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with a message point, in the spirit of Schalkwijk and Kailath's scheme for point-to-point channels or Ozarow and Leung's scheme for BCs with private messages, are strictly suboptimal for this setup. Even with perfect feedback, the largest rate ach... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Relationships Among Optimal Symmetric Fix-Free Codes

    Publication Year: 2014 , Page(s): 4567 - 4583
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (661 KB) |  | HTML iconHTML  

    Symmetric fix-free codes are prefix condition codes in which each codeword is required to be a palindrome. Their study is motivated by the topic of joint source-channel coding and by some information retrieval problems. Although they have been considered by a few communities they are not well understood. In earlier work, we used a collection of instances of Boolean satisfiability problems as a too... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels

    Publication Year: 2014 , Page(s): 4584 - 4613
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2522 KB) |  | HTML iconHTML  

    A setup involving zero-delay sequential transmission of a vector Markov source over a burst erasure channel is studied. A sequence of source vectors is compressed in a causal fashion at the encoder, and the resulting output is transmitted over a burst erasure channel. The destination is required to reconstruct each source vector with zero-delay, but those source sequences that are observed either ... View full abstract»

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

    Publication Year: 2014 , Page(s): 4614 - 4636
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1703 KB) |  | HTML iconHTML  

    We propose a novel group testing method, termed semiquantitative group testing (SQGT), motivated by a class of problems arising in genome screening experiments. The SQGT is a (possibly) nonbinary pooling scheme that may be viewed as a concatenation of an adder channel and an integer-valued quantizer. In its full generality, SQGT may be viewed as a unifying framework for group testing, in the sense... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes With Local Regeneration and Erasure Correction

    Publication Year: 2014 , Page(s): 4637 - 4660
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1673 KB) |  | HTML iconHTML  

    Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the numbe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Family of Optimal Locally Recoverable Codes

    Publication Year: 2014 , Page(s): 4661 - 4676
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (326 KB) |  | HTML iconHTML  

    A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the encoding is a function of a small number (at most r ) other symbols. We present a family of LRC codes that attain the maximum possible value of the distance for a given locality parameter and code cardinality. The codewords are obtained as evaluations of specially constructed polynomials over a finite f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Programming Decoding of Spatially Coupled Codes

    Publication Year: 2014 , Page(s): 4677 - 4698
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1103 KB) |  | HTML iconHTML  

    For a given family of spatially coupled codes, we prove that the linear programming (LP) threshold on the binary-symmetric channel (BSC) of the tail-biting graph cover ensemble is the same as the LP threshold on the BSC of the derived spatially coupled ensemble. This result is in contrast with the fact that spatial coupling significantly increases the belief propagation threshold. To prove this, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper Bounds on the Size of Grain-Correcting Codes

    Publication Year: 2014 , Page(s): 4699 - 4709
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (652 KB) |  | HTML iconHTML  

    In this paper, we revisit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in the recording medium. We present new upper bounds on the cardinality/rate of binary block codes that correct errors within this model. All our bounds, except for one, are obtained using combinatorial arguments based on h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials

    Publication Year: 2014 , Page(s): 4710 - 4721
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1568 KB) |  | HTML iconHTML  

    Let m ≥ 3 be an odd integer and p be an odd prime. In this paper, a number of classes of three-weight cyclic codes C(1,e) over Fp, which have parity-check polynomial m1(x)me(x), are presented by examining general conditions on the parameters p, m, and e, where mi(x) is the minimal polynomial of π-i over Fp for a primitive element π o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accessible Capacity of Secondary Users

    Publication Year: 2014 , Page(s): 4722 - 4738
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2336 KB) |  | HTML iconHTML  

    A new problem formulation is presented for the Gaussian interference channels with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder that were originally designed to satisfy a given error performance requirement under the assumption that no interference exists from other users. In the scenario when... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel Capacity Under Sub-Nyquist Nonuniform Sampling

    Publication Year: 2014 , Page(s): 4739 - 4756
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1767 KB) |  | HTML iconHTML  

    This paper investigates the effect of sub-Nyquist sampling upon the capacity of an analog channel. The channel is assumed to be a linear time-invariant Gaussian channel, where perfect channel knowledge is available at both the transmitter and the receiver. We consider a general class of right-invertible time-preserving sampling methods which includes irregular nonuniform sampling, and characterize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-Antenna Interference Channels With Real Interference Alignment and Receive Antenna Joint Processing Based on Simultaneous Diophantine Approximation

    Publication Year: 2014 , Page(s): 4757 - 4769
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (509 KB) |  | HTML iconHTML  

    In this paper, the degrees of freedom (DoF) regions of constant coefficient multiple antenna interference channels are investigated. First, we consider a K-user Gaussian interference channel with Mk antennas at transmitter k, 1 ≤ k ≤ K, and Nj antennas at receiver j, 1 ≤ j ≤ K, denoted as a (K, [Mk], [Nj]) channel. Relying on a result of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference Mitigation and Signal Enhancement for Multiuser MIMO Interference Channels With Redundant Antennas

    Publication Year: 2014 , Page(s): 4770 - 4785
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (524 KB) |  | HTML iconHTML  

    For a transceiver pair in a multiuser Gaussian interference channel with multiple antennas, if the number of transmit antennas is greater than the number of receive antennas, then in an equivalent virtual channel this transceiver pair has redundant transmit antennas. These redundant antennas do not contribute to the transmission to the intended receiver, however, may generate interference to other... 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