By Topic

Information Theory, IEEE Transactions on

Issue 9 • Date Sept. 2008

Filter Results

Displaying Results 1 - 25 of 52
  • Table of contents

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

    Publication Year: 2008, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (42 KB)
    Freely Available from IEEE
  • Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes

    Publication Year: 2008, Page(s):3865 - 3872
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (241 KB) | HTML iconHTML

    The Gilbert-Varshamov (GV) bound states that the maximum size A2(n, d) of a binary code of length n and minimum distance d satisfies A2(n, d)ges2n/V(n, d-1) where V(n, d)=Sigmai=0 d(i n) stands for the volume of a Hamming ball of radius d. Recently, Jiang and Vardy showed that for binary nonlinear codes this bound can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packing and Covering Properties of Rank Metric Codes

    Publication Year: 2008, Page(s):3873 - 3883
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    This paper investigates packing and covering properties of codes with the rank metric. First, we investigate packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their parameters, and investigate their asymptotic covering properties. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Extraction and Complexity Limits of Graphical Models for Linear Codes

    Publication Year: 2008, Page(s):3884 - 3906
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (690 KB) | HTML iconHTML

    Two broad classes of graphical modeling problems for codes can be identified in the literature: constructive and extractive problems. The former class of problems concern the construction of a graphical model in order to define a new code. The latter class of problems concern the extraction of a graphical model for a (fixed) given code. The design of a new low-density parity-check code for some gi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information

    Publication Year: 2008, Page(s):3907 - 3928
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (674 KB) | HTML iconHTML

    The performance of algebraic soft-decision decoding of Reed-Solomon codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies for algebraic soft-decision decoding (SDD) with infinite cost are first studied over erasure channels and the binary-symmetric channel. The corresponding decoding radii are calculated in closed forms and tight bounds on the error pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying Codes and Covering Problems

    Publication Year: 2008, Page(s):3929 - 3950
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1546 KB) | HTML iconHTML

    The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1998, this problem has demonstrated its fundamental nature through a wide variety of applications, such as fault diagnosis, location detection, and environmental monitoring, in addition to deep connections to information t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rank-Metric Approach to Error Control in Random Network Coding

    Publication Year: 2008, Page(s):3951 - 3967
    Cited by:  Papers (144)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    The problem of error control in random linear network coding is addressed from a matrix perspective that is closely related to the subspace perspective of Rotter and Kschischang. A large class of constant-dimension subspace codes is investigated. It is shown that codes in this class can be easily constructed from rank-metric codes, while preserving their distance properties. Moreover, it is shown ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Throughput-Diversity-Delay Tradeoff in MIMO ARQ Block-Fading Channels

    Publication Year: 2008, Page(s):3968 - 3986
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (786 KB) | HTML iconHTML

    In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input-multiple-output (MIMO) channel. Unlike previous work, we allow for multiple fading blocks within each transmission (ARQ round), and we constrain the transmitter to fixed rate codes constructed over complex signal constellations. In particular, we examine the general cas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Approach for Mutual Information Analysis of Large Dimensional Multi-Antenna Channels

    Publication Year: 2008, Page(s):3987 - 4004
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (451 KB) | HTML iconHTML

    This paper adresses the behavior of the mutual information of correlated multiple-input multiple-output (MIMO) Rayleigh channels when the numbers of transmit and receive antennas converge to +infin at the same rate. Using a new and simple approach based on Poincare-Nash inequality and on an integration by parts formula, it is rigorously established that the mutual information when properly centere... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Relay–Eavesdropper Channel: Cooperation for Secrecy

    Publication Year: 2008, Page(s):4005 - 4019
    Cited by:  Papers (255)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (545 KB) | HTML iconHTML

    This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest is t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Rate Control for Delay-Constrained Data Transmission Over a Wireless Channel

    Publication Year: 2008, Page(s):4020 - 4039
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (585 KB) | HTML iconHTML

    We study energy-efficient transmission of data with deadline constraints over a time-varying channel. Specifically, the system model consists of a wireless transmitter with controllable transmission rate, time-varying and stochastic channel state, and strict delay constraints on the packets in the queue. While the transmitter can control the rate, the transmission power required depends on the cho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions of Optical 2-to-1 FIFO Multiplexers With a Limited Number of Recirculations

    Publication Year: 2008, Page(s):4040 - 4052
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB) | HTML iconHTML

    Recently, there has been a lot of attention in the literature on a less well-known aspect of queueing theory, the theory of the constructions of queues. Such an interest originates mainly from optical packet switching due to the lack of optical buffers. These constructions of optical queues are based on optical switches and fiber delay lines (SDL). Theoretical studies in the SDL constructions have... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Inference From Co-Occurrences

    Publication Year: 2008, Page(s):4053 - 4068
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (675 KB) | HTML iconHTML

    The discovery of networks is a fundamental problem arising in numerous fields of science and technology, including communication systems, biology, sociology, and neuroscience. Unfortunately, it is often difficult, or impossible, to obtain data that directly reveal network structure, and so one must infer a network from incomplete data. This paper considers inferring network structure from "co-occu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Nearest Neighbor of the Nearest Neighbor in Multidimensional Continuous and Quantized Space

    Publication Year: 2008, Page(s):4069 - 4080
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    The probability that an entity in a set of entities uniformly distributed in space is the nearest neighbor of its nearest neighbor is evaluated for generic distances in a multidimensional environment. Such an expression is then specialized for systems with norm-based distances and for systems with quantized norm- based distance. Examples for scalar products and sup-norm are derived. When applicabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Node-Based Optimal Power Control, Routing, and Congestion Control in Wireless Networks

    Publication Year: 2008, Page(s):4081 - 4106
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (890 KB) | HTML iconHTML

    In wireless networks, important network functionalities such as power control, rate allocation, routing, and congestion control must be optimized in a coherent and integrated manner. In this work, an interference-limited wireless network is considered, whereby power control and routing variables are chosen to minimize the sum of link costs which depend on both link capacities and link flow rates. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case

    Publication Year: 2008, Page(s):4107 - 4118
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (335 KB) | HTML iconHTML

    In data communication networks, packets that arrive at the receiving host may be disordered for reasons such as retransmission of dropped packets or multipath routing. Reliable protocols such as the Transmission Control Protocol (TCP) require packets to be accepted, i.e., delivered to the receiving application, in the order they are transmitted at the sender. In order to do so, the receiver's tran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Delay–Throughput Tradeoffs in Mobile Ad Hoc Networks

    Publication Year: 2008, Page(s):4119 - 4143
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (629 KB) | HTML iconHTML

    In this paper, we investigate the delay-throughput tradeoffs in mobile ad-hoc networks. We consider four node mobility models: 1) two-dimensional independent and identically distributed (i.i.d.) mobility, 2) two-dimensional hybrid random walk, 3) one-dimensional i.i.d. mobility, and 4) one-dimensional hybrid random walk. Two mobility time scales are included in this paper. i) Fast mobility,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential Detection of Markov Targets With Trajectory Estimation

    Publication Year: 2008, Page(s):4144 - 4154
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (767 KB) | HTML iconHTML

    The problem of detection and possible estimation of a signal generated by a dynamic system when a variable number of noisy measurements can be taken is here considered. Assuming a Markov evolution of the system (in particular, the pair signal-observation forms a hidden Markov model (HMM)), a sequential procedure is proposed, wherein the detection part is a sequential probability ratio test (SPRT) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Fusion Trees for Detection: Does Architecture Matter?

    Publication Year: 2008, Page(s):4155 - 4168
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (359 KB) | HTML iconHTML

    We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally independent and identically distributed (i.i.d.) observations. We characterize the optimal error exponent under a Neyman-Pearson formulation. We show that the Type II error probability decays exponentially fast with the nu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-Dimensional Projection for Classification and Statistical Learning

    Publication Year: 2008, Page(s):4169 - 4182
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB) | HTML iconHTML

    In this paper, a new method for the binary classification problem is studied. It relies on empirical minimization of the hinge risk over an increasing sequence of finite-dimensional spaces. A suitable dimension is picked by minimizing the regularized risk, where the regularization term is proportional to the dimension. An oracle-type inequality is established for the excess generalization r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State Discrimination With Post-Measurement Information

    Publication Year: 2008, Page(s):4183 - 4198
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (401 KB) | HTML iconHTML

    We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. The following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases (MUBs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nice Error Bases and Sylow Subgroups

    Publication Year: 2008, Page(s):4199 - 4207
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB) | HTML iconHTML

    Nice error bases have various applications in quantum computing such as in the teleportation of quantum states and in the theory of noiseless systems. Associated in a natural way to any nice error basis there is a so-called index group and also a group of central type. In this paper, we will extend the number of known index groups for nice error bases by exploiting the connections between groups o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Quantum Capacity With Symmetric Side Channels

    Publication Year: 2008, Page(s):4208 - 4217
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    In this paper, we present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have no capacity on their own. This family of assistance channels, which we call symmetric side channels, consists of all channels mapping symmetricall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Classes of Quadratic APN Binomials Inequivalent to Power Functions

    Publication Year: 2008, Page(s):4218 - 4229
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (350 KB) | HTML iconHTML

    This paper introduces the first found infinite classes of almost perfect nonlinear (APN) polynomials which are not Carlet-Charpin-Zinoviev (CCZ)-equivalent to power functions (at least for some values of the number of variables). These are two classes of APN binomials from F2n to F2n (for n divisible by 3, resp., 4). We prove that these functions are extended affine (EA)-ineq... 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