By Topic

Information Theory, IEEE Transactions on

Issue 3 • Date March 2011

Filter Results

Displaying Results 1 - 25 of 48
  • Table of contents

    Publication Year: 2011 , Page(s): C1 - C4
    Request Permissions | PDF file iconPDF (44 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2011 , Page(s): C2
    Request Permissions | PDF file iconPDF (42 KB)  
    Freely Available from IEEE
  • Performance Analysis of the Interval Algorithm for Random Number Generation Based on Number Systems

    Publication Year: 2011 , Page(s): 1177 - 1185
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (255 KB) |  | HTML iconHTML  

    In this paper we analyze the interval algorithm for random number generation proposed by Han and Hoshi using the expression of real numbers on the interval . We first establish an explicit representation of the interval algorithm with the representation of real numbers on the interval based on number systems. Next, using the expression of the interval algorithm, we give a rigorous analysis of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Feedback Communication Via Posterior Matching

    Publication Year: 2011 , Page(s): 1186 - 1222
    Cited by:  Papers (24)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (756 KB) |  | HTML iconHTML  

    In this paper, we introduce a fundamental principle for optimal communication over general memoryless channels in the presence of noiseless feedback, termed posterior matching. Using this principle, we devise a (simple, sequential) generic feedback transmission scheme suitable for a large class of memoryless channels and input distributions, achieving any rate below the corresponding mutual inform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Exponents for the Gaussian Channel With Active Noisy Feedback

    Publication Year: 2011 , Page(s): 1223 - 1236
    Cited by:  Papers (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (306 KB) |  | HTML iconHTML  

    We study the best exponential decay in the block length of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an expected block power constraint on the forward link and study both almost-sure and expected block power constraints on the feedback link. In both cases the best achievable err... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achievable Rates for Nonlinear Volterra Channels

    Publication Year: 2011 , Page(s): 1237 - 1248
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (524 KB) |  | HTML iconHTML  

    Random coding theorems and achievable rates for nonlinear additive noise channels are presented. Modeling the channel's nonlinear behavior as a causal, stationary Volterra system, upper bounds on the average error probability are obtained for maximum likelihood and weakly typical set decoding. The proposed bounds are deduced by treating correct decoding regions as subspaces of high concentration m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Achievable Rates for the General Relay Channel

    Publication Year: 2011 , Page(s): 1249 - 1266
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (414 KB) |  | HTML iconHTML  

    In this paper, we present results on the equivalence of some coding strategies for the general relay channel. Cover & El Gamal described two basic coding strategies for the relay channel, more commonly known as decode-and-forward and compress-and-forward. These two strategies were combined in a mixed strategy that employed irregular encoding and successive forward decoding to give a tighter lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Capacity of Memoryless Finite-State Multiple-Access Channels With Asymmetric State Information at the Encoders

    Publication Year: 2011 , Page(s): 1267 - 1273
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (168 KB) |  | HTML iconHTML  

    A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial (quantized) state information, and complete channel state information is available at the receiver. The partial channel state information is assumed to be asymmet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • To Decode the Interference or to Consider It as Noise

    Publication Year: 2011 , Page(s): 1274 - 1283
    Cited by:  Papers (10)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (254 KB) |  | HTML iconHTML  

    In this paper, the impact of noncoordinated interfering signals on a point to point communication is addressed. While the transmitter has no information about the other users' messages, the receiver has full knowledge of the codebooks of the interfering users and can potentially decode some part of the interference. A simple coding strategy is proposed for this channel. Assuming its own data is de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semiunitary Precoding for Spatially Correlated MIMO Channels

    Publication Year: 2011 , Page(s): 1284 - 1298
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (514 KB) |  | HTML iconHTML  

    The focus of this paper is on spatial precoding in correlated multiantenna channels where the number of data-streams is adapted independent of the number of transmit antennas. Towards the goal of a low-complexity implementation, a statistical semiunitary precoder is studied where the precoder matrix evolves fairly slowly with respect to the channel evolution. While prior work on statistical precod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Two-User Gaussian Multiple Access Channels With Finite Input Constellations

    Publication Year: 2011 , Page(s): 1299 - 1327
    Cited by:  Papers (30)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (858 KB) |  | HTML iconHTML  

    Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Multiple Access schemes (NO-MA) and Orthogonal Multiple Access schemes (O-MA). For NO-MA schemes, a metric is proposed to compute the angle(s) of rotation between the input constellations such that the CC capacity regions are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mux/Demux Queues, FIFO Queues, and Their Construction by Fiber Memories

    Publication Year: 2011 , Page(s): 1328 - 1343
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1262 KB) |  | HTML iconHTML  

    This paper considers a packet multiplexer (resp. de multiplexer) in the form of a queue with a single time-multiplexed input (resp. output) line, which is called a multiplexing queue (resp. demultiplexing queue). This queue is abstractly formulated in a way that allows recursive construction via 2-stage interconnection. The theoretic underpinning of this recursive construction is the preservation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-Efficient Transmission Scheduling With Strict Underflow Constraints

    Publication Year: 2011 , Page(s): 1344 - 1367
    Cited by:  Papers (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (627 KB) |  | HTML iconHTML  

    This paper considers a single source transmitting data to one or more receivers/users over a shared wireless channel. Due to random fading, the wireless channel conditions vary with time and from user to user. Each user has a buffer to store received packets before they are drained. At each time step, the source determines how much power to use for transmission to each user. The source's objective... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair Scheduling in Networks Through Packet Election

    Publication Year: 2011 , Page(s): 1368 - 1381
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (498 KB) |  | HTML iconHTML  

    We consider the problem of designing a fair scheduling algorithm for discrete-time constrained queuing networks. Each queue has dedicated exogenous packet arrivals. There are constraints on which queues can be served simultaneously. This model effectively describes important special instances like network switches, interference in wireless networks, bandwidth sharing for congestion control and tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes on Graphs: Duality and MacWilliams Identities

    Publication Year: 2011 , Page(s): 1382 - 1397
    Cited by:  Papers (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (397 KB) |  | HTML iconHTML  

    A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier transform pair, whether or not the graphs have cycles. The original normal graph duality theorem follows as a corollary. Within this framework, MacWilliams identi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limits to List Decoding of Random Codes

    Publication Year: 2011 , Page(s): 1398 - 1408
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (295 KB) |  | HTML iconHTML  

    It has been known since [Zyablov and Pinsker, 1982] that a random q-ary code of rate 1 - Hq(ρ) - ε (where 0 <; ρ <; 1 - 1/q, ε >; 0 is small enough and -Hq(·) is the g-ary entropy function) with high probability is a (ρ, 1/ε) -list decodable code (that is, every Hamming ball of radius at most pn has at most 1/ε ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refined Coding Bounds and Code Constructions for Coherent Network Error Correction

    Publication Year: 2011 , Page(s): 1409 - 1424
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (455 KB) |  | HTML iconHTML  

    Coherent network error correction is the error-control problem in network coding with the knowledge of the network codes at the source and sink nodes. With respect to a given set of local encoding kernels defining a linear network code, we obtain refined versions of the Hamming bound, the Singleton bound, and the Gilbert-Varshamov bound for coherent network error correction. Similar to its classic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact-Repair MDS Code Construction Using Interference Alignment

    Publication Year: 2011 , Page(s): 1425 - 1442
    Cited by:  Papers (42)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1271 KB) |  | HTML iconHTML  

    The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of MDS codes, called Repair MDS codes, that can significantly reduce repair bandwidth over conventional MDS codes. In this paper, we describe (n, k, d) Exact-Repair MDS codes, which allow for any failed node to be repaired exactly with access to d survivor nodes, where k ≤ d ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding

    Publication Year: 2011 , Page(s): 1443 - 1456
    Cited by:  Papers (8)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (341 KB) |  | HTML iconHTML  

    We clarify the relationship among several existing achievable multiple description rate-distortion regions by investigating the role of refinement layer in multiple description coding. Specifically, we show that the refinement layer in the El Gamal-Cover (EGC) scheme and the Venkataramani-Kramer-Goyal (VKG) scheme can be removed; as a consequence, the EGC region is equivalent to the EGC* region (a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Rate Loss of Multiple Sources Codes in the Wyner–Ziv Setting

    Publication Year: 2011 , Page(s): 1457 - 1465
    Request Permissions | Click to expandAbstract | PDF file iconPDF (248 KB) |  | HTML iconHTML  

    In this paper, we consider the rate loss and achievable region of multiple sources codes (also named multiterminal source codes) in the Wyner-Ziv setting (WZ-MSC), in which two stationary memoryless sources (X, Y) are compressed separately from each other at respective rates R1 and R2, and the joint decoder, having access to the side information S which is correlated with sou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes

    Publication Year: 2011 , Page(s): 1466 - 1478
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (299 KB) |  | HTML iconHTML  

    This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the marginal distribution, namely exponentially decreasing envelope classes with exponent . The minimax redundancy of exponentially decreasing envelope classes is proved to be equivalent to . Then, an adaptive algorithm is propos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Index Coding With Side Information

    Publication Year: 2011 , Page(s): 1479 - 1494
    Cited by:  Papers (52)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (386 KB) |  | HTML iconHTML  

    Motivated by a problem of transmitting supplemental data over broadcast channels (Birk and Kol, INFOCOM 1998), we study the following coding problem: a sender communicates with n receivers R1,..., Rn. He holds an input x ∈ {0,01l}n and wishes to broadcast a single message so that each receiver Ri can recover the bit xi. Each Ri has prio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region

    Publication Year: 2011 , Page(s): 1495 - 1519
    Cited by:  Papers (14)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (709 KB) |  | HTML iconHTML  

    A distributed source coding problem with a joint distortion criterion that depends on the sources and the reconstruction is considered in this work. While the prevalent trend in information theory has been to prove achievability results using Shannon's random coding arguments, using structured random codes offer rate gains over unstructured random codes for many problems. Motivated by this, a new ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Encoder Optimization for Multi-Resolution Scalar Quantizer Design

    Publication Year: 2011 , Page(s): 1520 - 1529
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (260 KB) |  | HTML iconHTML  

    The design of optimal multi-resolution scalar quantizers using the generalized Lloyd method was proposed by Brunk and Farvardin for the case of squared error distortion. Since the algorithm details heavily rely on the quadratic expression of the error function, its extension to general error functions faces some challenges, especially at the encoder optimization step. In this work we show how thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trace Representation and Linear Complexity of Binary e th Power Residue Sequences of Period p

    Publication Year: 2011 , Page(s): 1530 - 1547
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (451 KB) |  | HTML iconHTML  

    Let p = ef + 1 be an odd prime for some e and e and let f, be the finite field with Fp elements. In this paper, we explicitly describe the trace representations of the binary characteristic sequences (of period p) of all the cyclic difference sets D which are some union of cosets of eth powers He in Fp* (=Δ Fp{0}) for e ≤ 12. For... 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