By Topic

Information Theory, IEEE Transactions on

Issue 6 • Date Jun 2002

Filter Results

Displaying Results 1 - 25 of 35
  • Universal composite hypothesis testing: a competitive minimax approach

    Page(s): 1504 - 1517
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (498 KB) |  | HTML iconHTML  

    A novel approach is presented for the long-standing problem of composite hypothesis testing. In composite hypothesis testing, unlike in simple hypothesis testing, the probability function of the observed data, given the hypothesis, is uncertain as it depends on the unknown value of some parameter. The proposed approach is to minimize the worst case ratio between the probability of error of a decision rule that is independent of the unknown parameters and the minimum probability of error attainable given the parameters. The principal solution to this minimax problem is presented and the resulting decision rule is discussed. Since the exact solution is, in general, hard to find, and a fortiori hard to implement, an approximation method that yields an asymptotically minimax decision rule is proposed. Finally, a variety of potential application areas are provided in signal processing and communications with special emphasis on universal decoding View full abstract»

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

    Page(s): 1518 - 1569
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1314 KB) |  | HTML iconHTML  

    An overview of statistical and information-theoretic aspects of hidden Markov processes (HMPs) is presented. An HMP is a discrete-time finite-state homogeneous Markov chain observed through a discrete-time memoryless invariant channel. In recent years, the work of Baum and Petrie (1966) on finite-state finite-alphabet HMPs was expanded to HMPs with finite as well as continuous state spaces and a general alphabet. In particular, statistical properties and ergodic theorems for relative entropy densities of HMPs were developed. Consistency and asymptotic normality of the maximum-likelihood (ML) parameter estimator were proved under some mild conditions. Similar results were established for switching autoregressive processes. These processes generalize HMPs. New algorithms were developed for estimating the state, parameter, and order of an HMP, for universal coding and classification of HMPs, and for universal decoding of hidden Markov channels. These and other related topics are reviewed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Duality between channel capacity and rate distortion with two-sided state information

    Page(s): 1629 - 1638
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (452 KB) |  | HTML iconHTML  

    We show that the duality between channel capacity and data compression is retained when state information is available to the sender, to the receiver, to both, or to neither. We present a unified theory for eight special cases of channel capacity and rate distortion with state information, which also extends existing results to arbitrary pairs of independent and identically distributed (i.i.d.) correlated state information (S1, S2) available at the sender and at the receiver, respectively. In particular, the resulting general formula for channel capacity C = maxp(u,x|s1) [I(U; S2, Y) I(U; S1)] assumes the same form as the generalized Wyner-Ziv (1976) rate distortion function R(D) = minp(u|x, s1)p(x&capped;|u, s2) [I(U; S 1, X) 1(U; S2)] View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source coding, large deviations, and approximate pattern matching

    Page(s): 1590 - 1615
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (872 KB) |  | HTML iconHTML  

    We present a development of parts of rate-distortion theory and pattern-matching algorithms for lossy data compression, centered around a lossy version of the asymptotic equipartition property (AEP). This treatment closely parallels the corresponding development in lossless compression, a point of view that was advanced in an important paper of Wyner and Ziv in 1989. In the lossless case, we review how the AEP underlies the analysis of the Lempel-Ziv algorithm by viewing it as a random code and reducing it to the idealized Shannon code. This also provides information about the redundancy of the Lempel-Ziv algorithm and about the asymptotic behavior of several relevant quantities. In the lossy case, we give various versions of the statement of the generalized AEP and we outline the general methodology of its proof via large deviations. Its relationship with Barron (1985) and Orey's (1985, 1986) generalized AEP is also discussed. The lossy AEP is applied to (i) prove strengthened versions, of Shannon's(1948, 1974) direct source-coding theorem and universal coding theorems; (ii) characterize the performance of "mismatched" codebooks in lossy data compression; ( iii) analyze the performance of pattern-matching algorithms for lossy compression (including Lempel-Ziv schemes); and (iv) determine the first-order asymptotic of waiting times between stationary processes. A refinement to the lossy AEP is then presented, and it is used to (i) prove second-order (direct and converse) lossy source-coding theorems, including universal coding theorems; (ii) characterize which sources are quantitatively easier to compress; (iii) determine the second-order asymptotic of waiting times between stationary processes; and (iv) determine the precise asymptotic behavior of longest match-lengths between stationary processes. Finally, we discuss extensions of the above framework and results to random fields View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy and recurrence rates for stationary random fields

    Page(s): 1694 - 1697
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (283 KB) |  | HTML iconHTML  

    For a stationary random field {x(u): u ∈ Zd }, the recurrence time Rn(x) may be defined as the smallest positive k, such that the pattern {x(u): 0 ⩽ ui < n} is seen again, in a new position in the cube {0 ⩽ |ui | < k}. In analogy with the case of d = 1, where the pioneering work was done by Wyner and Ziv (1989), we prove here that the asymptotic growth of Rn(x) for ergodic fields is given by the entropy of the random field. The nonergodic case is also treated, as well as the recurrence times of central patterns in centered cubes. Both finite and countable state spaces are treated View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing the performance of unitary space-time group codes from their character table

    Page(s): 1355 - 1371
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (687 KB) |  | HTML iconHTML  

    Multiple antennas can greatly increase the data rate and reliability of a wireless communication link in a fading environment. Their success, however, depends on the design of cedes that achieve these promises. It is well known that unitary matrices can be used to design differentially modulated space-time codes. These codes have a particularly efficient description if they form a finite group under matrix multiplication. We show how to compute the parameters of such groups crucial for their use as space-time codes, using only the character table of the group. Since character tables for many groups are known and tabulated, this method could be used to quickly test, for a given group, which of its irreducible representations can be used to design good unitary space-time codes. We demonstrate our method by computing the eigenvalues of all the irreducible representations of the special linear group SL2(Fq) over a finite prime field Fq of odd characteristic, and study in detail the performance of a particular eight-dimensional representation of SL2 (F17) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for stock price fluctuations based on information

    Page(s): 1372 - 1378
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (271 KB) |  | HTML iconHTML  

    The author presents a new model for stock price fluctuations based on a concept of "information." In contrast, the usual Black-Scholes-Merton-Samuelson (1965, 1973) model is based on the explicit assumption that information is uniformly held by everyone and plays no role in stock prices. The new model is based on the evident nonuniformity of information in the market and the evident time delay until new information becomes generally known. A second contribution of the paper is to present some problems with explicit solutions which are of value in obtaining insights. Several problems of mathematical interest are compared in order to better understand which optimal stopping problems have explicit solutions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large-scale typicality of Markov sample paths and consistency of MDL order estimators

    Page(s): 1616 - 1628
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (549 KB) |  | HTML iconHTML  

    For Markov chains of arbitrary order, with finite alphabet A, almost sure sense limit theorems are proved on relative frequencies of k-blocks, and of symbols preceded by a given k-block, when k is permitted to grow as the sample size n grows. As-an application, the-consistency of two kinds of minimum description length (MDL) Markov order estimators is proved, with upper bound o(log n), respectively, α log n with α < 1/log |A|, on the permissible value of the estimated order. It was shown by Csiszar and Shields (see Ann. Statist., vol.28, p.1601-1619, 2000) that in the absence of any bound, or with bound α log n with large α consistency fails View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the reliability exponent of the exponential timing channel

    Page(s): 1681 - 1689
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (367 KB) |  | HTML iconHTML  

    We determine the reliability exponent E(R) of the Anantharam-Verdu (see ibid., vol.42, p.4-18, Jan.1996) exponential server timing channel with service rate μ for all rates R between a critical rate Rc = (μ/4) log 2 and the channel capacity C = e-1μ. For rates between 0 and Rc, we provide a random-coding lower bound Er(R) and a sphere-packing upper bound Esp(R) on E(R). We also determine that the cutoff rate R0 for this channel equals μ/4, thus answering a question posed by Sundaresan and Verdu (see ibid., vol.46, p.705-9, Mar. 2000). An interesting aspect of our results is that the lower bound Er (R) for the reliability exponent of the timing channel coincides with Wyner's reliability exponent for the photon-counting channel with no dark current and with peak power constraint it. Whether the reliability exponents of the two channels are actually equal everywhere remains open. This shows that the exponential server timing channel is at least as reliable as this type of a photon-counting channel for all rates View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral efficiency in the wideband regime

    Page(s): 1319 - 1343
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (766 KB) |  | HTML iconHTML  

    The tradeoff of spectral efficiency (b/s/Hz) versus energy-per-information bit is the key measure of channel capacity in the wideband power-limited regime. This paper finds the fundamental bandwidth-power tradeoff of a general class of channels in the wideband regime characterized by low, but nonzero, spectral efficiency and energy per bit close to the minimum value required for reliable communication. A new criterion for optimality of signaling in the wideband regime is proposed, which, in contrast to the traditional criterion, is meaningful for finite-bandwidth communication View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomness, arrays, differences and duality

    Page(s): 1698 - 1703
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (334 KB) |  | HTML iconHTML  

    Random variables that take on values in the finite field of q elements are considered. It is shown that joint distributions of such random variables are equivalently described by the individual distributions of their linear combinations. Random vectors X that are equally likely to take on any row of an arbitrary q-ary rectangular array as their value are treated extensively, together with the random vector ΔX defined as the difference between two independent versions of such a random vector. It is shown that linear combinations of exactly τ of the components of X are always biased toward 0. A quantitative measure βτ, of this bias is introduced and shown to be given by a sum of Krawtchouk polynomials. The vanishing of βτ is shown to be equivalent to the maximal randomness of linear combinations of exactly τ of the components of X as well as of ΔX. When the rows of the original array are the codewords of a q-ary linear code, then the bias βτ coincides with the number of codewords of Hamming weight τ in the dual code. The results of this article generalize certain well-known results such as the MacWilliams' (1977) identities and Delsarte's (1973) theorem on the significance of the "dual distance" of nonlinear codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gambling for the mnemonically impaired

    Page(s): 1379 - 1392
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (548 KB) |  | HTML iconHTML  

    We obtain asymptotically tight bounds on the maximum amount of information that a single bit of memory can retain about the entire past. At each of n successive epochs, a single fair bit is generated and a one-bit memory is updated according to a family of memory update rules (possibly probabilistic and time-dependent) depending only on the value of the new input bit and on the current state of the memory. The problem is to estimate the supremum over all possible update rules of the minimum mutual information between the state of the memory at time (n + 1) and each of the previous n input bits. We show that this supremum is asymptotically equal to 1/(2n2 ln 2) bit, as conjectured by Venkatesh and Franklin (1991). We use this result to derive asymptotically sharp estimates of related maximin correlations between the memory and the input bits, thus resolving two more questions left open by Venkatesh and Franklin and by Komlos et al. (1993). Finally, we generalize the results to the case of an m-bit memory, again obtaining asymptotically tight bounds in many cases View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient universal prediction algorithm for unknown sources with limited training data

    Page(s): 1690 - 1693
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (300 KB) |  | HTML iconHTML  

    Inspired by C. E. Shannon's celebrated paper: "Prediction and entropy of printed English" (1951), we consider the optimal prediction error for unknown finite-alphabet ergodic Markov sources, for prediction algorithms that make inference about the most probable incoming letter, where the distribution of the unknown source is apparent only via a short training sequence of N + 1 letters. We allow N to be a polynomial function of K, the order of the Markov source, rather than the classical case where N is allowed to be exponential in K. A lower bound on the prediction error is formulated for such universal prediction algorithms, that are based on suffixes that were observed somewhere in the past "training sequence" X-N-1 (i.e. it is assumed that the universal predictor, given the past (N + 1)-sequence which serves as a training sequence is no better than the optimal predictor given only the longest suffix that appeared somewhere in the past X-N -1 vector). For a class of stationary Markov sources (which includes all Markov sources with positive transition probabilities), a particular universal predictor is introduced, and it is demonstrated that its performance is "optimal" in the sense that it yields a prediction error which is close to the lower bound on the universal prediction error, with limited training data. The results are nonasymptotic in the sense that they express the effect of limited training data on the efficiency of universal predictors. An asymptotically optimal universal predictor which is based on pattern matching appears elsewhere in the literature. However, the prediction error of these algorithms does not necessarily come close to the lower bound in the nonasymptotic region View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback strategies for white Gaussian interference networks

    Page(s): 1423 - 1438
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (595 KB) |  | HTML iconHTML  

    A white Gaussian interference network is a channel with T transmitters and R receivers where the received symbols are linear combinations of the transmitted symbols and white Gaussian noise. This paper considers the case where K messages are transmitted through the network in a point-to-point manner, i.e., each message is encoded by exactly one transmitter and is destined for exactly one receiver. It is further assumed that feedback is available so that each transmitter sees the outputs of the receivers to which it is sending messages. Communication strategies based on the discrete Fourier transform (DFT) are developed that perform well for such networks. For multiple-access channels (K=T, R=1) with equal transmitter powers the strategies achieve the feedback sum-rate capacity if the powers are beyond some threshold. For the same channels with fixed transmitter powers and large K, the achievable sum-rate is approximately (log log K)/2 larger than the sum-rate capacity without feedback. For broadcast channels (T=1, K=R) with strong symmetries, the strategies achieve a monotonically increasing sum-rate with K. For interference channels (K=T=R) with strong interference, the strategies significantly enlarge the no-feedback capacity region by "correlation routing." View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The pros and cons of democracy

    Page(s): 1721 - 1725
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (332 KB) |  | HTML iconHTML  

    We introduce the concept of "democracy," in which the individual bits in a coarsely quantized representation of a signal are all given "equal weight" in the approximation to the original signal. We prove that such democratic representations cannot achieve the same accuracy as optimal nondemocratic schemes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalar versus vector quantization: worst case analysis

    Page(s): 1393 - 1409
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (519 KB) |  | HTML iconHTML  

    We study the potential merits of vector quantization and show that there can be an arbitrary discrepancy between the worst case rates required for scalar and vector quantization. Specifically, we describe a random variable and a distortion measure where quantization of a single instance to within a given distortion requires an arbitrarily large number of bits in the worst case, but quantization of multiple independent instances to within the same distortion requires an arbitrarily small number of bits per instance in the worst case. We relate this discrepancy to expander graphs, representation- and cover-numbers of set systems, and a problem studied by Slepian, Wolf, and Wyner (1973) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Gaussian watermarking game

    Page(s): 1639 - 1667
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (995 KB) |  | HTML iconHTML  

    Watermarking models a copyright protection mechanism where an original source sequence or "covertext" is modified before distribution to the public in order to embed some extra information. The embedding should be transparent (i.e., the modified data sequence or "stegotext" should be similar to the covertext) and robust (i.e., the extra information should be recoverable even if the stegotext is modified further, possibly by a malicious "attacker"). We compute the coding capacity of the watermarking game for a Gaussian covertext and squared-error distortions. Both the public version of the game (covertext known to neither attacker nor decoder) and the private version of the game (covertext unknown to attacker but known to decoder) are treated. While the capacity of the former cannot, of course, exceed the capacity of the latter, we show that the two are, in fact, identical. These capacities depend critically on whether the distortion constraints are required to be met in expectation or with probability one. In the former case, the coding capacity is zero, whereas in the latter it coincides with the value of related zero-sum dynamic mutual information games of complete and perfect information. We also compute the capacity when the attacker is restricted to additive attacks. This capacity turns out to be strictly larger than the watermarking capacity, thus demonstrating that additive attacks are suboptimal. In fact, under the additive attack restriction, capacity turns out to coincide with the capacity of Costa's (1983) model for "writing on dirty paper," thus demonstrating that in Costa's model, the independent and identically distributed (i.i.d.) Gaussian "noise" is the most malevolent power-limited "noise". Additionally, Costa's observation that in the presence of i.i.d. Gaussian "noise," an i.i.d. Gaussian "dirt" process that is noncausally known to the transmitter (but not receiver) does not reduce capacity, is extended to general ergodic "dirt" and to stationary (but not necessarily white) Gaussian "noise" View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-length analysis of low-density parity-check codes on the binary erasure channel

    Page(s): 1570 - 1579
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (463 KB) |  | HTML iconHTML  

    In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively. We also give expressions for upper bounds on the average bit and block erasure probability for regular LDPC ensembles and the standard random ensemble under maximum-likelihood (ML) decoding. Finally, we present what we consider to be the most important open problems in this area View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Filter bank frame expansions with erasures

    Page(s): 1439 - 1450
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (436 KB) |  | HTML iconHTML  

    We study frames for robust transmission over the Internet. In our previous work, we used quantized finite-dimensional frames to achieve resilience to packet losses; here, we allow the input to be a sequence in l2(Z) and focus on a filter-bank implementation of the system. We present results in parallel, RN or CN versus l2(Z), and show that uniform tight frames, as well as newly introduced strongly uniform tight frames, provide the best performance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cayley differential unitary space-time codes

    Page(s): 1485 - 1503
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (601 KB) |  | HTML iconHTML  

    One method for communicating with multiple antennas is to encode the transmitted data differentially using unitary matrices at the transmitter, and to decode differentially without knowing the channel coefficients at the receiver. Since channel knowledge is not required at the receiver, differential schemes are ideal for use on wireless links where channel tracking is undesirable or infeasible, either because of rapid changes in the channel characteristics or because of limited system resources. Although this basic principle is well understood, it is not known how to generate good-performing constellations of unitary matrices, for any number of transmit and receive antennas and for any rate. This is especially true at high rates where the constellations must be rapidly encoded and decoded. We propose a class of Cayley codes that works with any number of antennas, and has efficient encoding and decoding at any rate. The codes are named for their use of the Cayley transform, which maps the highly nonlinear Stiefel manifold of unitary matrices to the linear space of skew-Hermitian matrices. This transformation leads to a simple linear constellation structure in the Cayley transform domain and to an information-theoretic design criterion based on emulating a Cauchy random matrix. Moreover, the resulting Cayley codes allow polynomial-time near-maximum-likelihood (ML) decoding based on either successive nulling/canceling or sphere decoding. Simulations show that the Cayley codes allow efficient and effective high-rate data transmission in multiantenna communication systems without knowing the channel View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Writing sequences on the plane

    Page(s): 1344 - 1354
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (344 KB)  

    The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A good arrangement should enable the one-dimensional sequences to be modeled as Markov chains or shifts of finite type. Since this is not possible in general, two-dimensional data is most commonly scanned by rows, columns, or diagonals. We look into three unusual ways to write a sequence,in the plane: by Penrose tilings, by space-filling curves, and by cylindrical and spiral lattices. We show how Penrose tilings can be used to record information and how some spiral lattices can be used for quantization of color spaces View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error exponents of expander codes

    Page(s): 1725 - 1729
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (298 KB) |  | HTML iconHTML  

    We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between zero and the channel capacity. The decoding complexity grows linearly with the code length View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communicating via a processing broadcast satellite

    Page(s): 1243 - 1249
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (362 KB) |  | HTML iconHTML  

    Three dependent users are physically separated but communicate with each other via a satellite. Each user generates data which it stores locally. In addition, each user sends a message to the satellite. The satellite processes the messages received from the users and broadcasts one common message to all three users. Each user must be capable of reconstructing the data of the other two users based upon the broadcast message and its own stored data. Our problem is to determine the minimum amount of information which must be transmitted to and from the satellite. The solution to this problem is obtained for the case where subsequent data triples that are produced by the users are independent and identically distributed. The three symbols within each triple are assumed to be dependent. Crucial for the solution is an achievability proof that involves cascaded Slepian-Wolf (1973) source coding View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal codes for finite sequences of integers drawn from a monotone distribution

    Page(s): 1713 - 1720
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (407 KB)  

    We offer two noiseless codes for blocks of integers Xn = (X1, ..., Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class of memoryless sources with a possibly infinite alphabet whose marginal distribution is monotone. Specifically, we show that the expected code length L (Xn) of our first universal code is dominated by a linear function of the entropy of Xn. Further, we present a second universal code that is efficient in that its length is bounded by nHF + o(nHF), where HF is the entropy of F which is allowed to vary with n. Since these bounds hold for any n and any monotone F we are able to show that our codes are strongly minimax with respect to relative redundancy (as defined by Elias (1975)). Our proofs make use of the elegant inequality due to Aaron Wyner (1972) 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