IEEE Transactions on Information Theory

Issue 8 • Aug. 2003

Filter Results

Displaying Results 1 - 22 of 22
  • Contributors

    Publication Year: 2003, Page(s):2077 - 2080
    Request permission for commercial reuse | PDF file iconPDF (168 KB)
    Freely Available from IEEE
  • Additive successive refinement

    Publication Year: 2003, Page(s):1983 - 1991
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB) | HTML iconHTML

    Rate-distortion bounds for scalable coding, and conditions under which they coincide with nonscalable bounds, have been extensively studied. These bounds have been derived for the general tree-structured refinement scheme, where reproduction at each layer is an arbitrarily complex function of all encoding indexes up to that layer. However, in most practical applications (e.g., speech coding) "addi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards an information theory of large networks: an achievable rate region

    Publication Year: 2003, Page(s):1877 - 1894
    Cited by:  Papers (216)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1502 KB) | HTML iconHTML

    We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel (DMC). We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A relationship between quantization and watermarking rates in the presence of additive Gaussian attacks

    Publication Year: 2003, Page(s):1970 - 1982
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB) | HTML iconHTML

    A system which embeds watermarks in n-dimensional Gaussian data and distributes them in compressed form is studied. The watermarked/compressed data have to satisfy a distortion constraint, and the watermark has to be recoverable in a private scenario (in which the original data are available at the watermark detector). The performance of the system in the presence of additive Gaussian attacks is c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes for a long silence

    Publication Year: 2003, Page(s):2020 - 2023
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    We determine the exact exponential asymptotics of the maximum number of n-length binary strings any two of which differ in the following strong sense: there must be a coordinate in which one of them has a 1 in correspondence with a predetermined position within a "long run" of zeros in the other string. We discuss some generalizations and implications of this result. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple description quantization by deterministic annealing

    Publication Year: 2003, Page(s):2067 - 2075
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    The design of vector quantizers for diversity-based communication over two or more channels of possibly differing capacities and failure probabilities, is considered. The crucial dependence of current design techniques on initialization, especially of index assignment, is well recognized. Instead, we propose to pursue a deterministic annealing approach which is independent of initialization, does ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-rate vector quantization for detection

    Publication Year: 2003, Page(s):1951 - 1969
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1219 KB) | HTML iconHTML

    We investigate high-rate quantization for various detection and reconstruction loss criteria. A new distortion measure is introduced which accounts for global loss in best attainable binary hypothesis testing performance. The distortion criterion is related to the area under the receiver-operating-characteristic (ROC) curve. Specifically, motivated by Sanov's theorem, we define a performance curve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear transformation shift registers

    Publication Year: 2003, Page(s):2047 - 2052
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    In order to exploit word-oriented operations for linear-feedback shift registers (LFSRs), Tsaban and Vishne [2002] introduced the notion of linear transformation shift registers (TSRs). An implementation of their primitive TSR generating algorithm shows that the LFSR are paired for all transformations. We prove that the characteristic polynomials of a pair of LFSRs are either both irreducible or b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposing bent functions

    Publication Year: 2003, Page(s):2004 - 2019
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB) | HTML iconHTML

    In a recent paper , it was shown that the restrictions of bent functions to subspaces of codimension 1 and 2 are highly nonlinear. Here, we present an extensive study of the restrictions of bent functions to affine subspaces. We propose several methods which are mainly based on properties of the derivatives and of the dual of a given bent function. We solve an open problem due to Hou . We especial... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality

    Publication Year: 2003, Page(s):1912 - 1921
    Cited by:  Papers (744)  |  Patents (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (527 KB) | HTML iconHTML

    We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the vector broadcast channel, the corresponding point-to-point channel (where the receivers can cooperate), the multiple-access channel (MAC) (where the role o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence and loss bounds for Bayesian sequence prediction

    Publication Year: 2003, Page(s):2061 - 2067
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (442 KB) | HTML iconHTML

    The probability of observing xt at time t, given past observations x1...xt-1 can be computed if the true generating distribution μ of the sequences x1x2x3... is known. If μ is unknown, but known to belong to a class ℳ one can base one's prediction on the Bayes mix ξ defined as a weighted sum of distributions ν &isin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonal multiple access over time- and frequency-selective channels

    Publication Year: 2003, Page(s):1942 - 1950
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB) | HTML iconHTML

    Suppression of multiuser interference (MUI) and mitigation of time- and frequency-selective (doubly selective) channel effects constitute major challenges in the design of third-generation wireless mobile systems. Relying on a basis expansion model (BEM) for doubly selective channels, we develop a channel-independent block spreading scheme that preserves mutual orthogonality among single-cell user... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resilient functions over finite fields

    Publication Year: 2003, Page(s):2040 - 2046
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (365 KB) | HTML iconHTML

    Resilient functions play an important role in the art of information security. In this correspondence, we discuss the existence, construction, and enumeration of resilient functions over finite fields. We show that, for each finite field GF(q) with q > 3, we can easily construct a large number of (q, n, 1, n - 1) resilient functions, most of which include mixing terms. We give a general structure ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-Euclidean geometrical aspects of the Schur and Levinson-Szego algorithms

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

    In this paper, we address non-Euclidean geometrical aspects of the Schur and Levinson-Szego algorithms. We first show that the Lobachevski geometry is, by construction, one natural geometrical environment of these algorithms, since they necessarily make use of automorphisms of the unit disk. We next consider the algorithms in the particular context of their application to linear prediction. Then t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacities of bipartite Hamiltonians and unitary gates

    Publication Year: 2003, Page(s):1895 - 1911
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1026 KB) | HTML iconHTML

    We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A combinatorial approach to finding the capacity of the discrete noiseless channel

    Publication Year: 2003, Page(s):2024 - 2028
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (335 KB) | HTML iconHTML

    Shannon defined the capacity of the discrete noiseless channel (DNC) and considered a finite-state model from which the capacity can be calculated. Alternatively, the DNC may be (and often is) represented by a finite list of forbidden strings. In this correspondence, we demonstrate the application of combinatorial techniques to finding the Shannon capacity of the DNC directly from the forbidden li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint message-passing decoding of ldpc codes and partial-response channels

    Publication Year: 2003, Page(s): 2076
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (161 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Density estimation via exponential model selection

    Publication Year: 2003, Page(s):2052 - 2060
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB) | HTML iconHTML

    We address the problem of estimating some unknown density on a bounded interval using some exponential models of piecewise polynomials. We consider a finite collection of such models based on a family of partitions. And we study the maximum-likelihood estimator built on a data-driven selected model among this collection. In doing so, we validate Akaike's criterion if the partitions that we conside... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the probability of error in linear multiuser detection

    Publication Year: 2003, Page(s):1922 - 1941
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1501 KB) | HTML iconHTML

    The problem of determining the bit-error probability in linear multiuser detection analytically is considered. A number of upper and lower bounds are developed, some of which are very tight, and issues of asymptotic behavior, optimality, and Gaussian approximation are explored. Several special cases, including those of equi-energy and equi-correlated signals, are treated in some detail. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes

    Publication Year: 2003, Page(s):2028 - 2034
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (443 KB) | HTML iconHTML

    A binary extended 1-perfect code of length n + 1 = 2t is additive if it is a subgroup of Z2α × Z4β. The punctured code by deleting a Z2 coordinate (if there is one) gives a perfect additive code. 1-perfect additive codes were completely characterized and by using that characterization we compute the possible paramet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The duals of MMD codes are proper for error detection

    Publication Year: 2003, Page(s):2034 - 2038
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (307 KB) | HTML iconHTML

    A linear code, when used for error detection on a symmetric channel, is said to be proper if the corresponding undetected error probability increases monotonically in ε, the symbol error probability of the channel. Such codes are generally considered to perform well in error detection. A number of well-known classes of linear codes are proper, e.g., the perfect codes, MDS codes, MacDonald's c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new inequality in discrete Fourier theory

    Publication Year: 2003, Page(s):2038 - 2040
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (259 KB) | HTML iconHTML

    Discrete Fourier theory has been applied successfully in digital communication theory. In this correspondence, we prove a new inequality linking the number of nonzero components of a complex valued function defined on a finite Abelian group to the number of nonzero components of its Fourier transform. We characterize the functions achieving equality. Finally, we compare this inequality applied to ... 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
Prakash Narayan 

Department of Electrical and Computer Engineering