By Topic

Information Theory, IEEE Transactions on

Issue 3 • Date March 2013

Filter Results

Displaying Results 1 - 25 of 49
  • Table of Contents

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

    Publication Year: 2013 , Page(s): C2
    Save to Project icon | Request Permissions | PDF file iconPDF (143 KB)  
    Freely Available from IEEE
  • Asynchronous Capacity per Unit Cost

    Publication Year: 2013 , Page(s): 1213 - 1226
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3084 KB) |  | HTML iconHTML  

    The capacity per unit cost, or, equivalently, the minimum cost to transmit one bit, is a well-studied quantity under the assumption of full synchrony between the transmitter and the receiver. In many applications, such as sensor networks, transmissions are very bursty, with amounts of bits arriving infrequently at random times. In such scenarios, the cost of acquiring synchronization is significan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous Communication: Capacity Bounds and Suboptimality of Training

    Publication Year: 2013 , Page(s): 1227 - 1255
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (6601 KB) |  | HTML iconHTML  

    Several aspects of the problem of asynchronous point-to-point communication without feedback are developed when the source is highly intermittent. In the system model of interest, the codeword is transmitted at a random time within a prescribed window whose length corresponds to the level of asynchronism between the transmitter and the receiver. The decoder operates sequentially and communication ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous Communication: Exact Synchronization, Universality, and Dispersion

    Publication Year: 2013 , Page(s): 1256 - 1270
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3630 KB) |  | HTML iconHTML  

    Recently, Tchamkerten and coworkers proposed a novel variation of the problem of joint synchronization and error correction. This paper considers a strengthened formulation that requires the decoder to estimate both the message and the location of the codeword exactly. Such a scheme allows for transmitting data bits in the synchronization phase of the communication, thereby improving bandwidth and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Directed Information, Causal Estimation, and Communication in Continuous Time

    Publication Year: 2013 , Page(s): 1271 - 1287
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4370 KB) |  | HTML iconHTML  

    A notion of directed information between two continuous-time processes is proposed. A key component in the definition is taking an infimum over all possible partitions of the time interval, which plays a role no less significant than the supremum over “space” partitions inherent in the definition of mutual information. Properties and operational interpretations in estimation and comm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Empirical Processes, Typical Sequences, and Coordinated Actions in Standard Borel Spaces

    Publication Year: 2013 , Page(s): 1288 - 1301
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3666 KB) |  | HTML iconHTML  

    This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of measurable “test functions.” In the finite-alphabet case, we can take all uniformly bounded functions and recover the usual notion of strong typicality... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfectly Secure Encryption of Individual Sequences

    Publication Year: 2013 , Page(s): 1302 - 1310
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2457 KB) |  | HTML iconHTML  

    In analogy to the well-known notion of finite-state compressibility of individual sequences, due to Lempel and Ziv, we define a similar notion of “finite-state encryptability” of an individual plain-text sequence, as the minimum asymptotic key rate that must be consumed by finite-state encrypters so as to guarantee perfect secrecy in a well-defined sense. Our main basic result is tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limit Theorems in Hidden Markov Models

    Publication Year: 2013 , Page(s): 1311 - 1328
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (6083 KB) |  | HTML iconHTML  

    In this paper, under mild assumptions, we derive a law of large numbers, a central limit theorem with an error estimate, an almost sure invariance principle, and a variant of the Chernoff bound in finite-state hidden Markov models. These limit theorems are of interest in certain areas of information theory and statistics. Particularly, we apply the limit theorems to derive the rate of convergence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback

    Publication Year: 2013 , Page(s): 1329 - 1345
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (5925 KB) |  | HTML iconHTML  

    A coding scheme for the discrete memoryless broadcast channel with {noiseless, noisy, generalized} feedback is proposed, and the associated achievable region derived. The scheme is based on a block-Markov strategy combining the Marton scheme and a lossy version of the Gray-Wyner scheme with side information. In each block, the transmitter sends fresh data and update information that allows the rec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Results on Multiple-Input Multiple-Output Broadcast Channels With Confidential Messages

    Publication Year: 2013 , Page(s): 1346 - 1359
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3067 KB) |  | HTML iconHTML  

    This paper presents two new results on multiple-input multiple-output (MIMO) Gaussian broadcast channels with confidential messages. First, the MIMO Gaussian wiretap channel is revisited. A matrix characterization of the capacity-equivocation region is provided, which extends the previous result on the secrecy capacity to the more general imperfect secrecy setting. Next, the MIMO Gaussian broadcas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Encoding for Discrete Degraded Broadcast Channels

    Publication Year: 2013 , Page(s): 1360 - 1378
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (6823 KB) |  | HTML iconHTML  

    Consider a memoryless degraded broadcast channel (DBC) in which the channel output is a single-letter function of the channel input and the channel noise. As examples, for the Gaussian broadcast channel (BC), this single-letter function is real scalar addition and for the binary-symmetric BC, this single-letter function is modulo-two addition. This paper identifies several classes of discrete memo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Multiple-Access Channel With Causal Side Information: Double State

    Publication Year: 2013 , Page(s): 1379 - 1393
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4480 KB) |  | HTML iconHTML  

    We consider a memoryless multiple-access channel (MAC) that is governed by two independent memoryless state sequences, each of which is revealed to a different encoder in a strictly causal or causal way. The special case where one of the state sequences is deterministic (null) corresponds to an MAC governed by a single state that is revealed to only one of the encoders. We show that, even in the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple Access Channels With States Causally Known at Transmitters

    Publication Year: 2013 , Page(s): 1394 - 1404
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2928 KB) |  | HTML iconHTML  

    It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that the capacity region of a two-user MAC with independent states, each known strictly causally to one encoder, can be enlarged by letting the encoders send compressed past state information to the decoder. In this study, a g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders

    Publication Year: 2013 , Page(s): 1405 - 1416
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3585 KB) |  | HTML iconHTML  

    We derive the capacity region of arbitrarily varying multiple-access channels (AV-MACs) with conferencing encoders for both deterministic and random coding. For a complete description, it is sufficient that one conferencing capacity is positive. We obtain a dichotomy: either the channel's deterministic capacity region is zero or it equals the 2-D random coding region. We determine exactly when eit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Strategies for Simultaneous and Broadcast Relay Channels

    Publication Year: 2013 , Page(s): 1417 - 1443
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (8464 KB) |  | HTML iconHTML  

    Consider the simultaneous relay channel (SRC) that consists of a set of relay channels where the source wishes to transmit common and private information to each of the destinations. This problem is recognized as being equivalent to that of sending common and private information to several destinations in presence of helper relays where each channel outcome becomes a branch of the broadcast relay ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Degrees of Freedom Region of the MIMO Interference Channel With Output Feedback and Delayed CSIT

    Publication Year: 2013 , Page(s): 1444 - 1457
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3497 KB) |  | HTML iconHTML  

    The two-user multiple-input multiple-output (MIMO) interference channel (IC) with arbitrary numbers of antennas at each terminal is considered and the degrees of freedom (DoF) region is characterized in the presence of noiseless channel output feedback from each receiver to its respective transmitter and availability of delayed channel state information at the transmitters (CSIT). It is shown that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heegard–Berger and Cascade Source Coding Problems With Common Reconstruction Constraints

    Publication Year: 2013 , Page(s): 1458 - 1474
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4744 KB) |  | HTML iconHTML  

    In lossy source coding with side information at the decoder (i.e., the Wyner-Ziv problem), the estimate of the source obtained at the decoder cannot be generally reproduced at the encoder, due to its dependence on the side information. In some applications, this may be undesirable, and a common reconstruction (CR) requirement, whereby one imposes that the encoder and decoder be able to agree on th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-Wise Unequal Error Protection for Variable-Length Block Codes With Feedback

    Publication Year: 2013 , Page(s): 1475 - 1504
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (8057 KB) |  | HTML iconHTML  

    The bit-wise unequal error protection problem, for the case when the number of groups of bits l is fixed, is considered for variable-length block codes with feedback. An encoding scheme based on fixed-length block codes with erasures is used to establish inner bounds to the achievable performance for finite expected decoding time. A new technique for bounding the performance of variable-len... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels

    Publication Year: 2013 , Page(s): 1505 - 1516
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2494 KB) |  | HTML iconHTML  

    Channel coding over arbitrarily permuted parallel channels was first studied by Willems and coworkers. This paper introduces capacity-achieving polar coding schemes for arbitrarily permuted parallel channels where the component channels are memoryless, binary-input, and output-symmetric. View full abstract»

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

    Publication Year: 2013 , Page(s): 1517 - 1531
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3998 KB) |  | HTML iconHTML  

    A problem of index coding with side information was first considered by Birk and Kol in 1998. In this study, a generalization of index coding scheme, where transmitted symbols are subject to errors, is studied. Error-correcting methods for such a scheme, and their parameters, are investigated. In particular, the following question is discussed: given the side information hypergraph of index coding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Network Coding Approach to Loss Tomography

    Publication Year: 2013 , Page(s): 1532 - 1562
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (5428 KB) |  | HTML iconHTML  

    Network tomography aims at inferring internal network characteristics based on measurements at the edge of the network. In loss tomography, in particular, the characteristic of interest is the loss rate of individual links and multicast and/or unicast end-to-end probes are typically used. Independently, recent advances in network coding have shown that there are advantages from allowing intermedia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative Coding for Network Coding

    Publication Year: 2013 , Page(s): 1563 - 1572
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2457 KB) |  | HTML iconHTML  

    We consider communication over a noisy network under randomized linear network coding. Possible error mechanisms include node- or link-failures, Byzantine behavior of nodes, or an overestimate of the network min-cut. Building on the work of Kötter and Kschischang, we introduce a systematic oblivious random channel model. Within this model, codewords contain a header (this is the systematic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tilings With n -Dimensional Chairs and Their Applications to Asymmetric Codes

    Publication Year: 2013 , Page(s): 1573 - 1582
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2733 KB) |  | HTML iconHTML  

    An n-dimensional chair consists of an n -dimensional box from which a smaller n-dimensional box is removed. A tiling of an n-dimensional chair has two nice applications in some memories using asymmetric codes. The first one is in the design of codes that correct asymmetric errors with limited magnitude. The second one is in the design of n cells q -ary wri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonal Designs and a Cubic Binary Function

    Publication Year: 2013 , Page(s): 1583 - 1589
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1645 KB) |  | HTML iconHTML  

    Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is to construct designs maximizing the rate and minimizing the decoding delay. All known constructions of CODs are inductive or algorithmic. In this paper, we pre... 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