Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

IEEE Transactions on Information Theory

Issue 1 • Jan. 2010

Filter Results

Displaying Results 1 - 25 of 52
  • Table of contents

    Publication Year: 2010, Page(s):C1 - C4
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2010, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (41 KB)
    Freely Available from IEEE
  • 2010 Associate editors list

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • 2009 IEEE Information Theory Society Paper Award

    Publication Year: 2010, Page(s): 2
    Request permission for commercial reuse | PDF file iconPDF (364 KB)
    Freely Available from IEEE
  • 2009 IEEE Communications Society and Information Theory Society Joint Paper Award

    Publication Year: 2010, Page(s):3 - 5
    Request permission for commercial reuse | PDF file iconPDF (1262 KB)
    Freely Available from IEEE
  • Variations on a Theme by Schalkwijk and Kailath

    Publication Year: 2010, Page(s):6 - 17
    Cited by:  Papers (21)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (329 KB) | HTML iconHTML

    Schalkwijk and Kailath (1966) developed a class of block codes for Gaussian channels with ideal feedback for which the probability of decoding error decreases as a second-order exponent in block length for rates below capacity. This well-known but surprising result is explained and simply derived here in terms of a result by Elias (1956) concerning the minimum mean-square distortion achievable in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mutual Information for Stochastic Signals and LÉvy Processes

    Publication Year: 2010, Page(s):18 - 24
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (170 KB) | HTML iconHTML

    In this paper, some relations between estimation and mutual information are given by expressing two mutual information calculations in terms of two distinct estimation errors. Specifically the mutual information between a stochastic signal and a pure jump Levy process whose rate function depends on the signal is expressed in terms of a filtering error and the rate of change of this mutual informat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-Rate Feedback Can Achieve the Empirical Capacity

    Publication Year: 2010, Page(s):25 - 39
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (381 KB) | HTML iconHTML

    The utility of limited feedback for coding over an individual sequence of discrete memoryless channels is investigated. This study complements recent results showing how limited or noisy feedback can boost the reliability of communication. A strategy with fixed input distribution P is given that asymptotically achieves rates arbitrarily close to the mutual information induced by P an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Exponents of Optimum Decoding for the Interference Channel

    Publication Year: 2010, Page(s):40 - 56
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (670 KB) | HTML iconHTML

    Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that have been used in previous works, like joint typicality decoding, decoding based on interference cancellation, and decoding that considers the interference as a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback Capacity of Stationary Gaussian Channels

    Publication Year: 2010, Page(s):57 - 85
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    The feedback capacity of additive stationary Gaussian noise channels is characterized as the solution to a variational problem in the noise power spectral density. When specialized to the first-order autoregressive moving-average noise spectrum, this variational characterization yields a closed-form expression for the feedback capacity. In particular, this result shows that the celebrated Schalkwi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Directly Lower Bounding the Information Capacity for Channels With I.I.D. Deletions and Duplications

    Publication Year: 2010, Page(s):86 - 102
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (429 KB) | HTML iconHTML

    In this paper, we directly lower bound the information capacity for channels with independent identically distributed (i.i.d.) deletions and duplications. Our approach differs from previous work in that we focus on the information capacity using ideas from renewal theory, rather than focusing on the transmission capacity by analyzing the error probability of some randomly generated code using a co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Final Case of the Decoding Delay Problem for Maximum Rate Complex Orthogonal Designs

    Publication Year: 2010, Page(s):103 - 112
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    Complex orthogonal space-time block codes (COSTBCs) based on generalized complex orthogonal designs (CODs) have been successfully implemented in wireless systems with multiple transmit antennas and single or multiple receive antennas. It has been shown that for a maximum rate COD with 2m-1 or 2m columns, a lower bound on decoding delay is (m-1 2m) and this delay is achievable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes

    Publication Year: 2010, Page(s):113 - 120
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (303 KB) | HTML iconHTML

    We show combinatorial limitations on efficient list decoding of Reed-Solomon codes beyond the Johnson-Guraswami-Sudan bounds. In particular, we show that for arbitrarily large fields FN, |FN| = N, for any ?? ?? (0,1), and K = N??: (1) Existence: there exists a received word wN : FN ?? FN that agrees with a super-polynomial number of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Woven Graph Codes: Asymptotic Performances and Examples

    Publication Year: 2010, Page(s):121 - 129
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (229 KB) | HTML iconHTML

    Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensembles of such codes based on s-partite, s-uniform hypergraphs, where s depends only on the code rate, there exist codes satisfying the Gilbert-Varshamov (GV) and the Costello lower bound on the minimum distance and the free distance, respect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic Decoding of a Class of Binary Cyclic Codes Via Lagrange Interpolation Formula

    Publication Year: 2010, Page(s):130 - 139
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (455 KB) | HTML iconHTML

    In this paper, three algebraic decoding algorithms are proposed for the binary quadratic residue (QR) codes generated by irreducible polynomials. The polynomial relations among the syndromes and the coefficients of the error-locator polynomials have been computed with Lagrange interpolation formula (LIF). Unlike some previous QR decoders, which may take several iterations to decode a corrupted wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Size Optimal q -ary Constant-Weight Codes and Constant-Composition Codes

    Publication Year: 2010, Page(s):140 - 151
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (374 KB) | HTML iconHTML

    An optimal constant-composition or constant-weight code of weight w has linear size if and only if its distance d is at least 2w-1. When d ¿ 2w, the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of d=2w-1 has been solved previously only for binary and ternary constant-composition and constant-weight codes, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth-Efficient Modulation Codes Based on Nonbinary Irregular Repeat–Accumulate Codes

    Publication Year: 2010, Page(s):152 - 167
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (623 KB) | HTML iconHTML

    Using nonbinary low-density parity-check (LDPC) codes with random-coset mapping, Bennatan and Burshtein constructed bandwidth-efficient modulation codes with remarkable performance under belief propagation (BP) decoding. However, due to the random nature of LDPC codes, most of the good LDPC codes found in the literature do not have a simple encoding structure. Thus, the encoding complexity of thos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semiorthogonal Space–Time Block Codes

    Publication Year: 2010, Page(s):168 - 180
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (569 KB) | HTML iconHTML

    In this paper, a new class of full-diversity, rate-one space-time block codes (STBCs) called semiorthogonal algebraic space-time block codes (SAST codes) is proposed. SAST codes are delay optimal when the number of transmit antennas is even. The SAST codeword matrix has a generalized Alamouti structure where the transmitted symbols are replaced by circulant matrices and the commutativity of circul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes

    Publication Year: 2010, Page(s):181 - 201
    Cited by:  Papers (80)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (678 KB) | HTML iconHTML

    The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to approach the Shannon limits for suitably large block lengths. For the intermediate block lengths relevant in applications, however, many LDPC codes exhibit a so-called ¿error floor,¿ corresponding to a significant flatteni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One-Point AG Codes on the GK Maximal Curves

    Publication Year: 2010, Page(s):202 - 210
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    In this paper, algebraic-geometric (AG) codes associated to a recently discovered class of maximal curves are investigated. As a result, some linear codes with better parameters with respect to the previously known ones are discovered, and 70 improvements on MinT's tables ("Tables of optimal parameters for linear codes,'' University of Salzburg, Salzburg, Austria) are obtained. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scale-Recursive Lattice-Based Multiple-Access Symbol Constellations

    Publication Year: 2010, Page(s):211 - 223
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    This paper describes scale-recursive symbol constellations for the synchronous multiple-access (MA) channel, which can be seen as a generalization of Voronoi coding. The constellations are related by a fixed scaling and rotation, and are designed so that in the noise-free case, the combined signal always falls onto an appropriate lattice. This allows high throughput and a linear complexity decodin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes for Deletion and Insertion Channels With Segmented Errors

    Publication Year: 2010, Page(s):224 - 232
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (278 KB) | HTML iconHTML

    We consider deletion channels and insertion channels under an additional segmentation assumption: the input consists of disjoint segments of b consecutive bits, with at most one error per segment. Under this assumption, we demonstrate simple and computationally efficient deterministic encoding and decoding schemes that achieve a high provable rate even under worst case errors. We also consi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Time Encoding of LDPC Codes

    Publication Year: 2010, Page(s):233 - 249
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1154 KB) | HTML iconHTML

    In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method ¿label-and-decide.¿ We prove that the ¿label-and-decide¿ method is applicable to Tanner graphs with a hierarchical structure-pseudo-trees-and that the resulting encoding complexity is linear with the code block length. Next, we define a second type of Tanne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic Distributed Space–Time Codes for Wireless Relay Networks With No Channel Information

    Publication Year: 2010, Page(s):250 - 265
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1591 KB) | HTML iconHTML

    In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver, or relays. The coding scheme uses distributed space-time coding, that is, the relay nodes cooperate to encode the transmitted signal so that the receiver senses a space-time codeword. It is inspired by noncoherent differential techniques. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Completely Regular q -ary Codes Based on Kronecker Products

    Publication Year: 2010, Page(s):266 - 272
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (195 KB) | HTML iconHTML

    For any integer ¿ ¿ 1 and for any prime power q , an explicit construction of an infinite family of completely regular (and completely transitive) q-ary codes with d = 3 and with covering radius ¿ is given. The intersection array is also computed. Under the same conditions, the explicit construction of an infinite family of q-ary uniformly packed codes (in the wide sense) with covering r... 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