IEEE Transactions on Information Theory

Volume 60 Issue 10 • Oct. 2014

Filter Results

Displaying Results 1 - 25 of 56
  • 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
  • Codes on Graphs: Fundamentals

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

    This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization duality; analysis of systems-theoretic properties of fragments of realizations and their connections; minimal Leftrightarrow trim and proper theorem for cycle-free cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial Limitations of Average-Radius List-Decoding

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

    We study certain combinatorial aspects of listdecoding, motivated by the exponential gap between the known upper bound (of O(1/γ)) and lower bound (of Ωp(log(1/γ))) for the list size needed to list decode up to error fraction p with rate γ away from capacity, i.e., 1 - h(p) - γ [here p E (0, 1/2) and γ > 0]. Our main result is that we prove that in any binary code C ⊆ (0, 1)n View full abstract»

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

    Publication Year: 2014, Page(s):5843 - 5855
    Cited by:  Papers (85)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1027 KB) | HTML iconHTML

    Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of off-the-shelf erasure codes is their high-repair cost during single node failure events. A major open problem in this area has been the design of codes that: 1) are repair ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs

    Publication Year: 2014, Page(s):5856 - 5874
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1266 KB) | HTML iconHTML

    Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-Length Scaling for Polar Codes

    Publication Year: 2014, Page(s):5875 - 5898
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB) | HTML iconHTML

    Consider a binary-input memoryless output-symmetric channel W. Such a channel has a capacity, call it I(W), and for any R <; I(W) and strictly positive constant Pe we know that we can construct a coding scheme that allows transmission at rate R with an error probability not exceeding Pe. Assume now that we let the rate R tend to I(W) and we ask how we have to scale the blocklength N ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication Over Finite-Chain-Ring Matrix Channels

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

    Though network coding is traditionally performed over finite fields, recent work on nested-lattice-based network coding suggests that, by allowing network coding over certain finite rings, more efficient physical-layer network coding schemes can be constructed. This paper considers the problem of communication over a finite-ring matrix channel Y = AX + BE, where X is the channel input, Y is the ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving AWGN Channel Capacity With Lattice Gaussian Coding

    Publication Year: 2014, Page(s):5918 - 5929
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (645 KB) | HTML iconHTML

    We propose a new coding scheme using only one lattice that achieves the 1/2 log(1 + SNR) capacity of the additive white Gaussian noise (AWGN) channel with lattice decoding, which is provable for signal-to-noise ratio SNR &gt; e at present. The scheme applies a discrete Gaussian distribution over an AWGN-good lattice, but otherwise does not require a shaping lattice or dither. Thus, it signific... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Lower Bounds on the Generalized Hamming Weights of AG Codes

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

    A sharp upper bound for the maximum integer not belonging to an ideal of a numerical semigroup is given and the ideals attaining this bound are characterized. Then, the result is used, through the so-called Feng-Rao numbers, to bound the generalized Hamming weights of algebraic-geometry codes. This is further developed for Hermitian codes and the codes on one of the Garcia-Stichtenoth towers, as w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes

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

    Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper, we elaborate on the implication of these parameters and devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes, our bound is often tight. Furthermore, for these codes, the r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing Linear Encoders With Good Spectra

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

    Linear encoders with good joint spectra are suitable candidates for optimal lossless joint source-channel coding (JSCC), where the joint spectrum is a variant of the input-output complete weight distribution and is considered good if it is close to the average joint spectrum of all linear encoders (of the same coding rate). In spite of their existence, little is known on how to construct such enco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum Pearson Distance Detection for Multilevel Channels With Gain and/or Offset Mismatch

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

    The performance of certain transmission and storage channels, such as optical data storage and nonvolatile memory (flash), is seriously hampered by the phenomena of unknown offset (drift) or gain. We will show that minimum Pearson distance (MPD) detection, unlike conventional minimum Euclidean distance detection, is immune to offset and/or gain mismatch. MPD detection is used in conjunction with T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Optimal Zero-Delay Coding of Vector Markov Sources

    Publication Year: 2014, Page(s):5975 - 5991
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    Optimal zero-delay coding (quantization) of a vector-valued Markov source driven by a noise process is considered. Using a stochastic control problem formulation, the existence and structure of optimal quantization policies are studied. For a finite-horizon problem with bounded per-stage distortion measure, the existence of an optimal zero-delay quantization policy is shown provided that the quant... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Infeasibility Proof and Information State in Network Information Theory

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

    In this paper, we revisit the structure of infeasibility results in network information theory, based on a notion of information state. We also discuss ideas for generalizing a known outer bound for lossless transmission of independent sources over a network to one of lossy transmission of dependent sources over the same network. To concretely demonstrate this, we apply our ideas and prove new res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refinement of the Random Coding Bound

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

    The problem of deriving refined bounds on the sub-exponential factor in the random coding bound for discrete memoryless channels is considered. In particular, for independent identically distributed random code ensembles and for rates above the critical rate, we prove that if a regularity condition is satisfied (respectively, not satisfied), then for any ε > 0 a sub-exponential factor of O(N View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact Random Coding Error Exponents of Optimal Bin Index Decoding

    Publication Year: 2014, Page(s):6024 - 6031
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    We consider ensembles of channel codes that are partitioned into bins, and focus on analysis of exact random coding error exponents associated with an optimum decoding of the index of the bin to which the transmitted codeword belongs. Two main conclusions arise from this analysis. First, for an independent random selection of codewords within a given type class, the random coding exponent of an op... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Data Processing Theorem in the Semi–deterministic Setting

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

    Data processing lower bounds on the expected distortion are derived in the finite-alphabet semideterministic setting, where the source produces a deterministic, individual sequence, but the channel model is probabilistic, and the decoder is subjected to various kinds of limitations, e.g., decoders implementable by finite-state machines, with or without counters, and with or without a restriction o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of a POST Channel With and Without Feedback

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

    We consider finite state channels, where the state of the channel is its previous output. We refer to these as Previous Output is the STate (POST) channels. We first focus on POST(α) channels. These channels have binary inputs and outputs, where the state determines if the channel behaves as a Z or an S channel, both with parameter α. We show that the nonfeedback capacity of the POST(α) channel eq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information Equals Amortized Communication

    Publication Year: 2014, Page(s):6058 - 6069
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (742 KB) | HTML iconHTML

    We show how to efficiently simulate the sending of a single message M to a receiver who has partial information about the message, so that the expected number of bits communicated in the simulation is close to the amount of additional information that the message reveals to the receiver. This is a generalization and strengthening of the Slepian-Wolf theorem, which shows how to carry out such a sim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Independent Signaling Achieves the Capacity Region of the Gaussian Interference Channel With Common Information to Within One Bit

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

    The interference channel with common information (IC-CI) consists of two transmit-receive pairs that communicate over a common noisy medium. Each transmitter has an individual message for its paired receiver, and additionally, both transmitters have a common message to deliver to both receivers. In this paper, through explicit inner and outer bounds on the capacity region, we establish the capacit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity-Achieving Distributions in Gaussian Multiple Access Channel With Peak Power Constraints

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

    This paper addresses a two-user Gaussian multiple access channel (MAC) under peak power constraints at the transmitters. It is shown that generating the code-books of both users according to discrete distributions with a finite number of mass points achieves the largest weighted sum-rate in the network. This verifies that any point on the boundary of the capacity region of a two-user MAC under pea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity Results for Binary Fading Interference Channels With Delayed CSIT

    Publication Year: 2014, Page(s):6093 - 6130
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4765 KB) | HTML iconHTML

    To study the effect of lack of up-to-date channel state information at the transmitters (CSITs), we consider two-user binary fading interference channels with Delayed-CSIT. We characterize the capacity region for such channels under homogeneous assumption, where channel gains have identical and independent distributions across time and space, eliminating the possibility of exploiting time/space co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Extremal Inequality and the Capacity Region of the Degraded Compound Gaussian MIMO Broadcast Channel With Multiple Users

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

    The two-user compound Gaussian MIMO broadcast channel models the situation where each user has a finite set of possible realizations. The transmitter sends two messages, one for each user, such that each user must be able to decode its message regardless of the actual realization. This channel also models a broadcast channel (BC) with two groups of users and two messages, with one message intended... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Capacity Region of a Class of Z Channels With Degraded Message Sets

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

    We study a two-transmitter two-receiver network where Receiver 1 can only hear the transmitted signal of Transmitter 1. Transmitter 1 has two messages, one of which is intended for Receiver 1 while both are intended for Receiver 2. Transmitter 2 has one message which is intended for Receiver 2. We call this channel model the Z channel with degraded message sets. For networks with the element of di... 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