IEEE Transactions on Information Theory

Volume 61 Issue 9 • Sept. 2015

Filter Results

Displaying Results 1 - 25 of 49
  • Table of contents

    Publication Year: 2015, Page(s):C1 - C4
    Request permission for commercial reuse | PDF file iconPDF (169 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 (140 KB)
    Freely Available from IEEE
  • Covering Point Patterns

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

    A source generates a point pattern consisting of a finite number of points in an interval. Based on a binary description of the point pattern, a reconstructor must produce a covering set that is guaranteed to contain the pattern. We study the optimal tradeoff (as the length of the interval tends to infinity) between the description length and the least average Lebesgue measure of the covering set.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Nonasymptotic Channel Coding Theorems for Structured Codes

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

    New nonasymptotic random coding theorems (with error probability E and finite block length n) based on Gallager parity check ensemble and general parity check ensembles are derived in this paper. The resulting nonasymptotic achievability bounds, when combined with nonasymptotic equipartition properties developed in this paper, can be easily computed. Analytically, these nonasymptotic achievability... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A General Formula for the Mismatch Capacity

    Publication Year: 2015, Page(s):4554 - 4568
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (315 KB) | HTML iconHTML

    The fundamental limits of channels with mismatched decoding are addressed. A general formula is established for the mismatch capacity of a general channel, defined as a sequence of conditional distributions with a general decoding metrics sequence. We deduce an identity between the Verdú-Han general channel capacity formula, and the mismatch capacity formula applied to maximum likelihood decoding ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Dispersions of the Gel’fand–Pinsker Channel and Dirty Paper Coding

    Publication Year: 2015, Page(s):4569 - 4586
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB) | HTML iconHTML

    This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a small fraction of the block to transmit the empirical distribution of the state sequence. For error probabilities less than 0.5, it is shown tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gaussian State Amplification with Noisy Observations

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

    We consider the problem of channel state amplification in a Gaussian channel with additive Gaussian channel states, where the encoder observes noncausally a noisy version of these states. A complete characterization is provided for the minimum reconstruction distortion under a transmitter power constraint, and it is shown that a simple analog scheme with power control is optimal. More precisely, i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum Power Control at Finite Blocklength

    Publication Year: 2015, Page(s):4598 - 4615
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB) | HTML iconHTML

    This paper investigates the maximal channel coding rate achievable at a given blocklength n and error probability ϵ, when the codewords are subjected to a long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in the large-n expansion of the maximal channel coding rate is characterized both for additive white Gaussian noise (AWGN) channels and for quasi-static fading ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outer Bounds on the Admissible Source Region for Broadcast Channels With Correlated Sources

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

    Two outer bounds on the admissible source region for broadcast channels with correlated sources are presented: the first one is strictly tighter than the existing outer bound by Gohari and Anantharam, while the second one provides a complete characterization of the admissible source region in the case where the two sources are conditionally independent given the common part. These outer bounds are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Diversity-Multiplexing Tradeoff of Unconstrained Multiple-Access Channels

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

    In this paper, the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channel with no power constraints (infinite constellations). For K users (K > 1), M transmit antennas for each user, and N receive antennas, infinite constellations in general and lattices in particular are shown to attain the optimal DMT of finite const... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gaussian Interference Channel With Intermittent Feedback

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

    We investigate how to exploit intermittent feedback for interference management by studying the two-user Gaussian interference channel (IC). We approximately characterize (within a universal constant) the capacity region for the Gaussian IC with intermittent feedback. We exactly characterize the capacity region of the linear deterministic version of the problem, which gives us insight into the Gau... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual Full-Duplex Relaying With Half-Duplex Relays

    Publication Year: 2015, Page(s):4700 - 4720
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1608 KB) | HTML iconHTML

    We consider virtual full-duplex relaying by means of half-duplex relays. In this configuration, each relay stage in a multihop relaying network is formed by at least two relays, used alternatively in transmit and receive modes, such that while one relay transmits its signal to the next stage, the other relay receives a signal from the previous stage. With such a pipelined scheme, the source is act... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity Approximations for Gaussian Relay Networks

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

    Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward-based strategies can achieve the capacity of this network within an additive gap. Here, the relays quantize their received signals at the noise level and map them to random Gaussian codebooks. The resultant gap to capaci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond Scaling Laws: On the Rate Performance of Dense Device-to-Device Wireless Networks

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

    We consider a device-to-device wireless network where n users are densely deployed in a squared planar region and communicate with each other without the help of a wired infrastructure. For this network, we examine the three-phase hierarchical cooperation scheme originally proposed by Ozgur, Leveque, and Tse, and the two-phase improved hierarchical cooperation scheme successively proposed by Ozgur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rank Matching for Multihop Multiflow

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

    We study the degrees of freedom (DoF) of the layered 2 × 2 × 2 multiple-input-multiple-output (MIMO) interference channel where each node is equipped with arbitrary number of antennas, the channels between the nodes have arbitrary rank constraints, and subject to the rank-constraints the channel coefficients can take arbitrary values. The DoF outer bounds reveal a fundamental rank-matching phenome... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive Computation of Type-Threshold Functions in Collocated Gaussian Networks

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

    In wireless sensor networks, various applications involve learning one or multiple functions of the measurements observed by sensors, rather than the measurements themselves. This paper focuses on the class of type-threshold functions, e.g., the maximum and the indicator functions. A simple network model capturing both the broadcast and superposition properties of wireless channels is considered: ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CSMA Using the Bethe Approximation: Scheduling and Utility Maximization

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

    Carrier sense multiple access (CSMA), which resolves contentions over wireless networks in a fully distributed fashion, has recently gained a lot of attentions since it has been proved that appropriate control of CSMA parameters guarantees optimality in terms of stability (i.e., scheduling) and system-wide utility (i.e., scheduling and congestion control). Most CSMA-based algorithms rely on the po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secret Communication Over Broadcast Erasure Channels With State-Feedback

    Publication Year: 2015, Page(s):4788 - 4808
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (857 KB) | HTML iconHTML

    We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore the achievable rate region when we require that the message to each receiver remains secret-in the information theoretical sense-from all the ot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Converses For Secret Key Agreement and Secure Computing

    Publication Year: 2015, Page(s):4809 - 4827
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB) | HTML iconHTML

    We consider information theoretic secret key (SK) agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the SK length, which is derived using a reduction of binary hypothesis testing to multiparty SK agreement. Building on this basic result, we derive new converses fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models

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

    We consider two secret key generation problems under a pairwise independent network model, and propose low complexity key generation schemes in a framework that connects our problems to network flow problems in graphs. Our schemes have two components: 1) local key generation and 2) global key propagation. In the local key generation, we use point-to-point source coding with side information to est... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scaling Exponent of List Decoders With Applications to Polar Codes

    Publication Year: 2015, Page(s):4838 - 4851
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff between the block length and back-off from capacity is analyzed. A lower bound is provided on the error probability under MAP decoding with list size... View full abstract»

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

    Publication Year: 2015, Page(s):4852 - 4865
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2377 KB) | HTML iconHTML

    An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes. Shortened codes obtained with the proposed method ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatially Coupled LDPC Codes Constructed From Protographs

    Publication Year: 2015, Page(s):4866 - 4889
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3153 KB) | HTML iconHTML

    In this paper, we construct protograph-based spatially coupled low-density parity-check (LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L , we obtain a flexible family of code ensembles with varying rates and frame lengths that can share the same encoding and decoding architecture for arbitrary L . We demonstra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-Overlapping Codes

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

    We say that a q-ary length n code is non-overlapping if the set of non-trivial prefixes of codewords and the set of non-trivial suffices of codewords are disjoint. These codes were first studied by Levenshtein in 1964, motivated by applications in synchronization. More recently these codes were independently invented (under the name cross-bifix-free codes) by Bajic and Stojanovic. We provide a sim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polyadic Constacyclic Codes

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

    For any given positive integer m, a necessary and sufficient condition for the existence of Type-I m-adic constacyclic codes is given. Furthermore, for any given integer s, a necessary and sufficient condition for s to be a multiplier of a Type-I polyadic constacyclic code is given. As an application, some optimal codes from Type-I polyadic constacyclic codes, including generalized Reed-Solomon co... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu