By Topic

Information Theory, IEEE Transactions on

Issue 8 • Date Aug. 2010

Filter Results

Displaying Results 1 - 25 of 44
  • Table of contents

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

    Publication Year: 2010 , Page(s): C2
    Request Permissions | PDF file iconPDF (42 KB)  
    Freely Available from IEEE
  • On Rate of Convergence of Statistical Estimation of Stationary Ergodic Processes

    Publication Year: 2010 , Page(s): 3637 - 3641
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (144 KB) |  | HTML iconHTML  

    Stationary ergodic processes with finite alphabets are approximated by finite memory processes based on an n-length realization of the process. Under the assumptions of summable continuity rate and non-nullness, a rate of convergence in -distance is obtained, with explicit constants. Asymptotically, as n → ∞, the result is near the optimum. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistent Estimation of Non-bandlimited Spectral Density From Uniformly Spaced Samples

    Publication Year: 2010 , Page(s): 3642 - 3659
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (376 KB) |  | HTML iconHTML  

    In the matter of selection of sample time points for the estimation of the power spectral density of a continuous time stationary stochastic process, irregular sampling schemes such as Poisson sampling are often preferred over regular (uniform) sampling. A major reason for this preference is the well-known problem of inconsistency of estimators based on regular sampling, when the underlying power ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains

    Publication Year: 2010 , Page(s): 3660 - 3691
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (671 KB) |  | HTML iconHTML  

    The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new bounds coincide and yield single-letter capacity characterizations for a class of channels with the state process known at the receiver, including channels whose long-term marginal state distribution is independent of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The 1 -Vertex Transfer Matrix and Accurate Estimation of Channel Capacity

    Publication Year: 2010 , Page(s): 3692 - 3699
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (333 KB) |  | HTML iconHTML  

    The notion of a 1-vertex transfer matrix for multidimensional codes is introduced. It is shown that the capacity of such codes, or the topological entropy, can be expressed as the limit of the logarithm of spectral radii of 1-vertex transfer matrices. Storage and computations using the 1-vertex transfer matrix are much smaller than storage and computations needed for the standard transfer matrix. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure Communications With Insecure Feedback: Breaking the High-SNR Ceiling

    Publication Year: 2010 , Page(s): 3700 - 3711
    Request Permissions | Click to expandAbstract | PDF file iconPDF (299 KB) |  | HTML iconHTML  

    A multiple-antenna Gaussian wiretap channel in which the number of antennas at the source is not greater than that at the eavesdropper is considered. Without feedback, the secrecy capacity over such a channel generally converges to a constant at high signal-to-noise ratio (SNR). A half-duplex secure protocol allowing the destination to actively transfer random keys in the form of known interferenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mismatched Estimation and Relative Entropy

    Publication Year: 2010 , Page(s): 3712 - 3720
    Cited by:  Papers (27)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (228 KB) |  | HTML iconHTML  

    A random variable with distribution P is observed in Gaussian noise and is estimated by a mismatched minimum mean-square estimator that assumes that the distribution is Q, instead of P . This paper shows that the integral over all signal-to-noise ratios (SNRs) of the excess mean-square estimation error incurred by the mismatched estimator is twice the relative entropy D(P ||Q) (in nats). This repr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rényi Information Dimension: Fundamental Limits of Almost Lossless Analog Compression

    Publication Year: 2010 , Page(s): 3721 - 3748
    Cited by:  Papers (32)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (572 KB) |  | HTML iconHTML  

    In Shannon theory, lossless source coding deals with the optimal compression of discrete sources. Compressed sensing is a lossless coding strategy for analog sources by means of multiplication by real-valued matrices. In this paper we study almost lossless analog compression for analog memoryless sources in an information-theoretic framework, in which the compressor or decompressor is constrained ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Moment Balancing Templates for Spectral Null Codes

    Publication Year: 2010 , Page(s): 3749 - 3753
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (111 KB) |  | HTML iconHTML  

    The generalized moment balancing templates for spectral null codes are investigated in this paper. A new approach based on the insertion of a determined number of vectors at determinate indices of a spectral null code word, is found to balance the moment of the code word. Moment balanced code words preserve the spectral null properties and can guarantee the correction of one insertion or one delet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes

    Publication Year: 2010 , Page(s): 3754 - 3778
    Cited by:  Papers (12)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1167 KB) |  | HTML iconHTML  

    A message independence property and some new performance upper bounds are derived in this work for erasure, list, and decision-feedback schemes with linear block codes transmitted over memoryless symmetric channels. Similar to the classical work of Forney, this work is focused on the derivation of some Gallager-type bounds on the achievable tradeoffs for these coding schemes, where the main novelt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of Binary Constant Weight Codes

    Publication Year: 2010 , Page(s): 3779 - 3785
    Cited by:  Papers (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (201 KB) |  | HTML iconHTML  

    A binary code C ⊆ F2n with minimum distance at least d and codewords of Hamming weight w is called an (n,d,w) constant weight code. The maximum size of an (n,d,w) constant weight code is denoted by A(n,d,w), and codes of this size are said to be optimal. In a computer-aided approach,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding Schemes for Noiseless and Noisy Asynchronous CDMA Systems

    Publication Year: 2010 , Page(s): 3786 - 3792
    Request Permissions | Click to expandAbstract | PDF file iconPDF (486 KB) |  | HTML iconHTML  

    Novel coding schemes for noiseless and noisy asynchronous code division multiple access (A-CDMA) systems are presented in this paper. The schemes use Wu-Chang spreading code, block interleaver, and synchronizable channel codes to support A-CDMA communications with random delays. For the noiseless case, each active user generates one of M messages, M = ⌊(2T-D -1)/(D + 1)⌋ ,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput Scaling of Wireless Networks With Random Connections

    Publication Year: 2010 , Page(s): 3793 - 3806
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (354 KB) |  | HTML iconHTML  

    This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperation With an Untrusted Relay: A Secrecy Perspective

    Publication Year: 2010 , Page(s): 3807 - 3827
    Cited by:  Papers (75)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (579 KB) |  | HTML iconHTML  

    We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should be deployed at all. That is, whether cooperation with an untrusted relay node can ever be beneficial. We first provide an achievable secrecy rate for the general... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Cooperative Advantages in Slotted ALOHA Random Access Networks

    Publication Year: 2010 , Page(s): 3828 - 3846
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1326 KB) |  | HTML iconHTML  

    In cooperative systems, users achieve spatial diversity and multihop gains by transmitting packets over multiple independent fading paths provided by their partners. Most previous works on cooperative communications focus on the physical layer aspects such as coding, modulation, and transceiver signal processing techniques. In this work, we study the advantages of user cooperation from a MAC layer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Broadcast Capacity of Wireless Networks With Cooperative Relays

    Publication Year: 2010 , Page(s): 3847 - 3861
    Cited by:  Papers (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (927 KB) |  | HTML iconHTML  

    A fundamental problem in wireless networks is determining the broadcast capacity, i.e., the maximum data transfer rate from a given node to every other node in a relay network. This paper studies the scaling of the broadcast capacity for a network with a single source and N destinations, of which f(N) are randomly selected to also act as relays. In high-density networks (i.e., the node density goe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Network Code Design for Cyclic Networks

    Publication Year: 2010 , Page(s): 3862 - 3878
    Cited by:  Papers (10)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (533 KB) |  | HTML iconHTML  

    This paper introduces an efficient polynomial-time code construction algorithm for cyclic networks, which achieves the optimal multicast rate. Until this work, no explicit capacity-achieving polynomial-time code construction for cyclic networks has been known. This new construction algorithm has the additional advantage that as sinks are added or removed from the network, it can modify the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pairwise Intersession Network Coding on Directed Networks

    Publication Year: 2010 , Page(s): 3879 - 3900
    Cited by:  Papers (33)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (541 KB) |  | HTML iconHTML  

    When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow theorem. For the case of more than one coexisting sessions, network coding also demonstrates throughput improvement over noncoded solutions. This paper proposes pairwise intersession network coding, which allows for arbi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Functional Compression Through Graph Coloring

    Publication Year: 2010 , Page(s): 3901 - 3917
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (461 KB) |  | HTML iconHTML  

    Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly correlated discrete sources such that an arbitrary but fixed deterministic function of those sources can be computed given the compressed data from each source. We consider both the lossless and lossy computation of a fun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property

    Publication Year: 2010 , Page(s): 3918 - 3929
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (426 KB) |  | HTML iconHTML  

    The “state-of-the-art” in length-limited Huffman coding (LLHC) algorithms is the Θ(nD)-time, Θ(n)-space one of Hirschberg and Larmore, where n is the size of the code and Dn is the length restriction on the codewords. This is a very clever, very problem specific, technique. This paper presents a simple dynamic-programming (DP... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Successive Refinement for the Kaspi/Heegard–Berger Problem

    Publication Year: 2010 , Page(s): 3930 - 3945
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (412 KB) |  | HTML iconHTML  

    Consider a source that produces independent copies of a triplet of jointly distributed random variables {Xi,Yi,Zi }z =1. The process {Xi} is observed at the encoder, and is supposed to be reproduced at two decoders, decoder Y and decoder Z, where {Yi} and {Zi} are observed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Sum Rate of Gaussian Multiterminal Source Coding: New Proofs and Results

    Publication Year: 2010 , Page(s): 3946 - 3960
    Cited by:  Papers (24)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (332 KB) |  | HTML iconHTML  

    We show that the lower bound on the sum rate of the direct and indirect Gaussian multiterminal source coding problems can be derived in a unified manner by exploiting the semidefinite partial order of the distortion covariance matrices associated with the minimum mean squared error (MMSE) estimation and the so-called reduced optimal linear estimation, through which an intimate connection between t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks

    Publication Year: 2010 , Page(s): 3961 - 3972
    Cited by:  Papers (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (317 KB) |  | HTML iconHTML  

    A distinct difference configuration is a set of points in Z2 with the property that the vectors (difference vectors) connecting any two of the points are all distinct. Many specific examples of these configurations have been previously studied: the class of distinct difference configurations includes both Costas arrays and sonar sequences, for example. Motivated by an application of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information-Theoretic Key Agreement of Multiple Terminals—Part I

    Publication Year: 2010 , Page(s): 3973 - 3996
    Cited by:  Papers (25)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (510 KB) |  | HTML iconHTML  

    We study the problem of information-theoretically secure secret key agreement under the well-known source model and channel model. In both of these models, multiple terminals wish to create a shared secret key that is secure from a passive eavesdropper. The terminals have access to a noiseless public communication channel and an additional resource that depends on the model. In the source model, t... 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