IEEE Transactions on Information Theory

Issue 5 • July 2001

Filter Results

Displaying Results 1 - 25 of 43
  • Call for papers

    Publication Year: 2001, Page(s): 2101
    Cited by:  Papers (10)
    Request permission for commercial reuse | PDF file iconPDF (17 KB)
    Freely Available from IEEE
  • Contributors

    Publication Year: 2001, Page(s):2102 - 2111
    Request permission for commercial reuse | PDF file iconPDF (69 KB)
    Freely Available from IEEE
  • On the Svanstrom bound for ternary constant-weight codes

    Publication Year: 2001, Page(s):2061 - 2064
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB) | HTML iconHTML

    Svanstrom (see IEEE ibid., vol.43, p.1630-2, Sept. 1997) gave a lower bound on the size of ternary constant-weight codes (CWCs). This bound is generalized and improved in some cases View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of reduced-rank linear interference suppression

    Publication Year: 2001, Page(s):1928 - 1946
    Cited by:  Papers (154)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB) | HTML iconHTML

    The performance of reduced-rank linear filtering is studied for the suppression of multiple-access interference. A reduced-rank filter resides in a lower dimensional space, relative to the full-rank filter, which enables faster convergence and tracking. We evaluate the large system output signal-to-interference plus noise ratio (SINR) as a function of filter rank D for the multistage Wiener filter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On unique, multiset, and set decipherability of three-word codes

    Publication Year: 2001, Page(s):1745 - 1757
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB) | HTML iconHTML

    The concepts of unique decipherability (UD), multiset decipherability (MSD), and set decipherability (SD) of codes were developed to handle some special problems in the transmission of information. In unique decipherability, different sequences of codewords carry different information. In multiset decipherability, the information of interest is the multiset of codewords used in the encoding proces... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MAP symbol decoding in channels with error bursts

    Publication Year: 2001, Page(s):1832 - 1838
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB) | HTML iconHTML

    We analyze the forward-backward algorithm for the maximum a posteriori (MAP) decoding of information transmitted over channels with memory and propose a suboptimal forward-only algorithm. We assume that both the information source and channel are described using hidden Markov models (HMMs). The algorithm lends itself to parallel implementation and pipelining. We apply the algorithm to MAP decoding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some good quantum error-correcting codes from algebraic-geometric codes

    Publication Year: 2001, Page(s):2059 - 2061
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB) | HTML iconHTML

    It is shown that quantum error correction can be achieved by the use of classical binary codes or additive codes over F4. In this correspondence, with the help of some algebraic techniques the theory of algebraic-geometric codes is used to construct an asymptotically good family of quantum error-correcting codes and other classes of good quantum error-correcting codes. Our results are c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern recognition algorithms based on space-filling curves and orthogonal expansions

    Publication Year: 2001, Page(s):1915 - 1927
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB) | HTML iconHTML

    The classical problem of constructing a multidimensional pattern classifier in the Bayesian framework is considered. Preprocessing of the learning sequence by a quasi-inverse of a space-filling curve is proposed and properties of space-filling curves which are necessary to obtain Bayes risk consistency are indicated. The learning sequence transformed into the unit interval is used to estimate the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance of linear parallel interference cancellation

    Publication Year: 2001, Page(s):1957 - 1970
    Cited by:  Papers (35)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB) | HTML iconHTML

    This paper analyzes the performance of the linear parallel interference cancellation (LPIC) multiuser detector in a synchronous multiuser communication scenario with binary signaling, nonorthogonal multiple access interference, and an additive white Gaussian noise channel. The LPIC detector has been considered in the literature lately due to its low computational complexity, potential for good per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary images of cyclic codes over Z4

    Publication Year: 2001, Page(s):1773 - 1779
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB) | HTML iconHTML

    We determine all linear cyclic codes over Z4 of odd length whose Gray images are linear codes (or, equivalently, whose Nechaev-Gray (1989) image are linear cyclic codes or are linear cyclic codes) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the robustness of single-loop sigma-delta modulation

    Publication Year: 2001, Page(s):1735 - 1744
    Cited by:  Papers (19)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    Sigma-delta modulation, a widely used method of analog-to-digital (A/D) signal conversion, is known to be robust to hardware imperfections, i.e., bit streams generated by slightly imprecise hardware components can be decoded comparably well. We formulate a model for robustness and give a rigorous analysis for single-loop sigma-delta modulation applied to constant signals (DC inputs) for N time cyc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong optimality of the normalized ML models as universal codes and information in data

    Publication Year: 2001, Page(s):1712 - 1717
    Cited by:  Papers (68)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    We show that the normalized maximum-likelihood (NML) distribution as a universal code for a parametric class of models is closest to the negative logarithm of the maximized likelihood in the mean code length distance, where the mean is taken with respect to the worst case model inside or outside the parametric class. We strengthen this result by showing that, when the data generating models are re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions of MDS-convolutional codes

    Publication Year: 2001, Page(s):2045 - 2049
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree &delta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving optimum coded diversity with scalar codes

    Publication Year: 2001, Page(s):2078 - 2080
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB) | HTML iconHTML

    In this correspondence, we consider the case of multiple-antenna transmission diversity. We outline a recent result on the maximum possible performance (in terms of mutual information) and show that it can be achieved using scalar codes instead of vector codes. The scalar coding schemes we propose are based on space-time block codes and do not involve any reduction in data rate for two transmitter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stream-oriented turbo codes

    Publication Year: 2001, Page(s):1813 - 1831
    Cited by:  Papers (13)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB) | HTML iconHTML

    This work considers the design and performance of a stream-oriented approach to turbo codes which avoids the need for data framing. The stream paradigm applies to both serial and parallel turbo codes using continuous, free-running constituent encoders along with continuous, periodic interleavers. A stream-oriented turbo code based on parallel concatenated convolutional codes (PCCC) is considered a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound

    Publication Year: 2001, Page(s):2055 - 2058
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB) | HTML iconHTML

    It is known that quantum error correction can be achieved using classical binary codes or additive codes over F4. Asymptotically good quantum codes have been constructed from algebraic-geometry codes and a bound on (δ, R) was computed from the Tsfasman-Vladut-Zink bound of the theory of classical algebraic-geometry codes. In this correspondence, by the use of a concatenat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rademacher penalties and structural risk minimization

    Publication Year: 2001, Page(s):1902 - 1914
    Cited by:  Papers (83)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB) | HTML iconHTML

    We suggest a penalty function to be used in various problems of structural risk minimization. This penalty is data dependent and is based on the sup-norm of the so-called Rademacher process indexed by the underlying class of functions (sets). The standard complexity penalties, used in learning problems and based on the VC-dimensions of the classes, are conservative upper bounds (in a probabilistic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the achievability of the Cramer-Rao bound for Poisson distribution

    Publication Year: 2001, Page(s):2096 - 2100
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB) | HTML iconHTML

    This correspondence examines the Cramer-Rao (CR) bound for data obtained in emission tomography. The likelihood function involved is the combined probability of independent Poisson random variables, the expectation of each being a linear function ciTλ of the parameter vector λ. We investigated the achievability of the CR bound in the interior and on the boundary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binomial and Poisson distributions as maximum entropy distributions

    Publication Year: 2001, Page(s):2039 - 2041
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB) | HTML iconHTML

    The binomial and the Poisson distributions are shown to be maximum entropy distributions of suitably defined sets. Poisson's law is considered as a case of entropy maximization, and also convergence in information divergence is established View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relationships between different error-correcting capabilities of a code

    Publication Year: 2001, Page(s):2065 - 2069
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    SID channels are discrete channels represented by expressions that involve combinations of the error types substitution, insertion, and deletion. In this correspondence, a simple distance is defined that generalizes the Hamming and Levenshtein distances. For a certain class of SID channels, the distance is used to obtain a necessary and sufficient condition for the error-correcting capability that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cumulant-based independence measures for linear mixtures

    Publication Year: 2001, Page(s):1947 - 1956
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    This paper deals with independence measures for linear mixtures of mutually independent random variables. Such measures, also known as contrasts, constitute useful criteria in solving blind source separation problems. By making use of the Schur convexity properties, we show that it is possible to define a wide-ranging class of contrast functions based on the auto-cumulants of the components of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On coset weight distributions of the Z4-linear Goethals codes

    Publication Year: 2001, Page(s):1758 - 1772
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB) | HTML iconHTML

    We study the coset weight distributions of two well-known families of codes: the three-error-correcting binary Z4-linear Goethals codes of length N=2m+1, m⩾3 odd, and the Z4 -linear Goethals codes over Z4 of length n=N/2=2m . The hard case is the weight distributions of cosets of weight 4. To know the weight distribution of the coset of we... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial-prefix synchronizable codes

    Publication Year: 2001, Page(s):1839 - 1848
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    A new class of codes for frame synchronization is proposed. Commonly, the beginning of every fixed or variable-length frame is identified by a given contiguous sequence called a prefix. To avoid the occurrence of the prefix elsewhere in the frame, a prefix synchronizable code (PS-code) is used. PS-codes have the property that the prefix does not occur in any codeword or in any concatenation of cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The throughput of hybrid-ARQ protocols for the Gaussian collision channel

    Publication Year: 2001, Page(s):1971 - 1988
    Cited by:  Papers (381)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB) | HTML iconHTML

    In next-generation wireless communication systems, packet-oriented data transmission will be implemented in addition to standard mobile telephony. We take an information-theoretic view of some simple protocols for reliable packet communication based on “hybrid-ARQ,” over a slotted multiple-access Gaussian channel with fading and study their throughput (total bit per second per hertz) a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing critical indecomposable codes

    Publication Year: 2001, Page(s):1780 - 1795
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB) | HTML iconHTML

    Critical indecomposable codes were introduced by Assmus (see ibid., vol.44, p.612-29, 1998), who also gave a recursive construction for these objects. One of the key ingredients in the construction is an auxiliary code, which is an indecomposable code of minimum distance at least 3. In terms of actually being able to construct all critical indecomposable codes, however, Assmus leaves many unanswer... 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