By Topic

IEEE Transactions on Information Theory

Issue 11 • Date Nov. 2006

Filter Results

Displaying Results 1 - 25 of 41
  • Table of contents

    Publication Year: 2006, Page(s):c1 - c4
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • Consensus Propagation

    Publication Year: 2006, Page(s):4753 - 4766
    Cited by:  Papers (90)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regular graphs, and demonstrate that the protocol exhibits better scaling properties than pairwise averaging, an alternative that has received much recent attention. Consensus propagation can be viewed as a special case of be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Strong Consistency of Model Selection in Classification

    Publication Year: 2006, Page(s):4767 - 4774
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    This paper considers model selection in classification. In many applications such as pattern recognition, probabilistic inference using a Bayesian network, prediction of the next in a sequence based on a Markov chain, the conditional probability P(Y=y|X=x) of class yisinY given attribute value xisinX is utilized. By model we mean the equivalence relation in X: for x,x'isinXx~x'hArrP(Y=y|X=x)=P(Y=y... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online Regularized Classification Algorithms

    Publication Year: 2006, Page(s):4775 - 4788
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (471 KB) | HTML iconHTML

    This paper considers online classification learning algorithms based on regularization schemes in reproducing kernel Hilbert spaces associated with general convex loss functions. A novel capacity independent approach is presented. It verifies the strong convergence of the algorithm under a very weak assumption of the step sizes and yields satisfactory convergence rates for polynomially decaying st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schemes for Bidirectional Modeling of Discrete Stationary Sources

    Publication Year: 2006, Page(s):4789 - 4807
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (635 KB) | HTML iconHTML

    We develop adaptive schemes for bidirectional modeling of unknown discrete stationary sources. These algorithms can be applied to statistical inference problems such as noncausal universal discrete denoising that exploit bidirectional dependencies. Efficient algorithms for constructing those models are developed and we compare their performance to that of the DUDE algorithm for universal discrete ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measurement of Time-Variant Linear Channels

    Publication Year: 2006, Page(s):4808 - 4820
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (787 KB) | HTML iconHTML

    The goal of channel measurement or operator identification is to obtain complete knowledge of a channel operator by observing the image of a finite number of input signals. In this paper, it is shown that the spreading support of the operator (that is, the support of the symplectic Fourier transform of the Kohn-Nirenberg symbol of the operator) has area less than one then the operator is identifia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single-User Broadcasting Protocols Over a Two-Hop Relay Fading Channel

    Publication Year: 2006, Page(s):4821 - 4838
    Cited by:  Papers (25)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1373 KB) | HTML iconHTML

    A two-hop relay fading channel is considered, where only decoders possess perfect channel state information (CSI). Various relaying protocols and broadcasting strategies are studied. The main focus of this work is on simple relay transmission scheduling schemes. For decode-and-forward (DF) relaying, the simple relay cannot buffer multiple packets, nor can it reschedule retransmissions. This gives ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight Distribution of Low-Density Parity-Check Codes

    Publication Year: 2006, Page(s):4839 - 4855
    Cited by:  Papers (79)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (649 KB) | HTML iconHTML

    We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns out that capacity-achieving sequences of standard (unstructured) LDPC codes under iterative decoding over the binary erasure channel (BEC) known... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Average Coset Weight Distribution of Combined LDPC Matrix Ensembles

    Publication Year: 2006, Page(s):4856 - 4866
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (490 KB) | HTML iconHTML

    In this paper, the average coset weight distribution (ACWD) of structured ensembles of low-density parity-check (LDPC) matrices, which are called combined ensembles, is discussed. A combined ensemble is composed of a set of simpler ensembles such as a regular bipartite ensemble. Two classes of combined ensembles have prime importance; a stacked ensemble and a concatenated ensemble. The ACWD formul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Stopping Redundancy of Reed–Muller Codes

    Publication Year: 2006, Page(s):4867 - 4879
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (306 KB) | HTML iconHTML

    The stopping redundancy of the code is an important parameter which arises from analyzing the performance of a linear code under iterative decoding on a binary erasure channel. In this paper, we will consider the stopping redundancy of Reed-Muller codes and related codes. Let R(lscr,m) be the Reed-Muller code of length 2m and order lscr. Schwartz and Vardy gave a recursive construction ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel

    Publication Year: 2006, Page(s):4880 - 4891
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB) | HTML iconHTML

    Error exponents are studied for recursive decoding of Reed-Muller (RM) codes and their subcodes used on a binary-symmetric channel. The decoding process is first decomposed into similar steps, with one new information bit derived in each step. Multiple recursive additions and multiplications of the randomly corrupted channel outputs plusmn1 are performed using a specific order of these two operati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonbinary Stabilizer Codes Over Finite Fields

    Publication Year: 2006, Page(s):4892 - 4914
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (718 KB) | HTML iconHTML

    One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. To address this difficulty, many good quantum error-correcting codes have been derived as binary stabilizer codes. Fault-tolerant quantum computation prompted the study of nonbinary quantum codes, but the theory of such codes is n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal Lossless Compression With Unknown Alphabets—The Average Case

    Publication Year: 2006, Page(s):4915 - 4944
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB) | HTML iconHTML

    Universal compression of patterns of sequences generated by independent and identically distributed (i.i.d.) sources with unknown, possibly large, alphabets is investigated. A pattern is a sequence of indices that contains all consecutive indices in increasing order of first occurrence. If the alphabet of a source that generated a sequence is unknown, the inevitable cost of coding the unknown alph... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation

    Publication Year: 2006, Page(s):4945 - 4964
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (445 KB) | HTML iconHTML

    Asymptotically optimal real-valued bit allocation among a set of quantizers for a finite collection of sources was derived in 1963 by Huang and Schultheiss, and an algorithm for obtaining an optimal nonnegative integer-valued bit allocation was given by Fox in 1966. We prove that, for a given bit budget, the set of optimal nonnegative integer-valued bit allocations is equal to the set of nonnegati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution

    Publication Year: 2006, Page(s):4965 - 4976
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB) | HTML iconHTML

    In this paper, we characterize functions that simulate independent unbiased coin flips from independent coin flips of unknown bias. We call such functions randomizing. Our characterization of randomizing functions enables us to identify the functions that generate the largest average number of fair coin flips from a fixed number of biased coin flips. We show that these optimal functions are effici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial Capacity of Multiple-Access Wireless Networks

    Publication Year: 2006, Page(s):4977 - 4988
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    We study the capacity of multiple-access networks both on uplink and downlink. In our model each user requires a given signal-to-interference-plus-noise ratio (SINR) and the capacity region is obtained as a solution of a power allocation problem. In this paper, we emphasize the differences between uplink and downlink. The mathematical analysis of the capacity region is given in the framework of er... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations

    Publication Year: 2006, Page(s):4989 - 5007
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB) | HTML iconHTML

    Achievable rates over the discrete memoryless relay channel with partial feedback configurations are proposed. Specifically, we consider partial feedback from the receiver to the sender as well as partial feedback from the relay to the sender. These achievable rates are calculated for the general Gaussian and the Z relay channels and are shown to improve on the known one-way achievable rates View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Multiuser Capacity of WDM in a Nonlinear Optical Fiber: Coherent Communication

    Publication Year: 2006, Page(s):5008 - 5022
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (355 KB) | HTML iconHTML

    Previous results suggest that the crosstalk produced by the fiber nonlinearity in a WDM system imposes a severe limit to the capacity of optical fiber channels, since the interference power increases faster than the signal power, thereby limiting the maximum achievable signal-to-interference-plus-noise ratio (SINR). We study this system in the weakly nonlinear regime as a multiple-access channel, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel With Degraded Message Sets

    Publication Year: 2006, Page(s):5023 - 5044
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    An inner bound on the deterministic-code capacity region of the two-user discrete memoryless arbitrarily varying general broadcast channel (AVGBC) was characterized by Jahn, assuming that the common message capacity is nonzero; however, he did not indicate how one could decide whether the latter capacity is positive. Csiszaacuter and Narayan's result for the single-user arbitrarily varying channel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MIMO Broadcast Channels With Finite-Rate Feedback

    Publication Year: 2006, Page(s):5045 - 5060
    Cited by:  Papers (759)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1368 KB) | HTML iconHTML

    Multiple transmit antennas in a downlink channel can provide tremendous capacity (i.e., multiplexing) gains, even when receivers have only single antennas. However, receiver and transmitter channel state information is generally required. In this correspondence, a system where each receiver has perfect channel knowledge, but the transmitter only receives quantized information regarding the channel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Space–Time Trellis Codes Achieving Optimal Diversity Multiplexing Tradeoff

    Publication Year: 2006, Page(s):5060 - 5067
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (395 KB) | HTML iconHTML

    Multiple antennas can be used for increasing the amount of diversity (diversity gain) or increasing the data rate (the number of degrees of freedom or spatial multiplexing gain) in wireless communication. As quantified by Zheng and Tse, given a multiple-input-multiple-output (MIMO) channel, both gains can, in fact, be simultaneously obtained, but there is a fundamental tradeoff (called the Diversi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks

    Publication Year: 2006, Page(s):5067 - 5077
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    We prove that for any finite directed acyclic network, there exists a corresponding multiple-unicast network, such that for every alphabet, each network is solvable if and only if the other is solvable, and, for every finite-field alphabet, each network is linearly solvable if and only if the other is linearly solvable. The proof is constructive and creates an extension of the original network by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Min-Cost Selfish Multicast With Network Coding

    Publication Year: 2006, Page(s):5077 - 5087
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (509 KB) | HTML iconHTML

    The single-source min-cost multicast problem, which can be framed as a convex optimization problem with the use of network codes and convex increasing edge costs is considered. A decentralized approach to this problem is presented by Lun, Ratnakar for the case where all users cooperate to reach the global minimum. Further, the cost for the scenario where each of the multicast receivers greedily ro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Large Deviations Analysis of Scheduling in Wireless Networks

    Publication Year: 2006, Page(s):5088 - 5098
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB) | HTML iconHTML

    In this correspondence, we consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queue-length-based (QLB) policy and a greedy policy) given an upper bound on the queue overflow probability or the delay viola... 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