By Topic

IEEE Transactions on Information Theory

Issue 4 • Date July 2000

Filter Results

Displaying Results 1 - 25 of 58
  • Contributors

    Publication Year: 2000, Page(s):1697 - 1708
    Request permission for commercial reuse | PDF file iconPDF (98 KB)
    Freely Available from IEEE
  • Duality theorems for joint source-channel coding

    Publication Year: 2000, Page(s):1263 - 1275
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    We consider joint source-channel coding for a memoryless Gaussian source and an additive white Gaussian noise (AWGN) channel. For a given code defined by an encoder-decoder pair (α, β), its dual code is obtained by interchanging the encoder and decoder: (β, α). It is shown that if a code (α, β) is optimal at rate p channel uses per source sample and if it satisfies... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noise prediction for channels with side information at the transmitter

    Publication Year: 2000, Page(s):1610 - 1617
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    The computation of channel capacity with side information at the transmitter side (but not at the receiver side) requires, in general, extension of the input alphabet to a space of “strategies”, and is often hard. We consider the special case of a discrete memoryless module-additive noise channel Y=X+Zs, where the encoder observes causally the random state S∈S that gove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity and mutual information of wideband multipath fading channels

    Publication Year: 2000, Page(s):1384 - 1400
    Cited by:  Papers (172)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    We investigate the capacity and mutual information of a broadband fading channel consisting of a finite number of time-varying paths. We show that the capacity of the channel in the wideband limit is the same as that of a wideband Gaussian channel with the same average received power. However, the input signals needed to achieve the capacity must be “peaky” in time or frequency. In par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal lossless compression via multilevel pattern matching

    Publication Year: 2000, Page(s):1227 - 1245
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    A universal lossless data compression code called the multilevel pattern matching code (MPM code) is introduced. In processing a finite-alphabet data string of length n, the MPM code operates at O(log log n) levels sequentially. At each level, the MPM code detects matching patterns in the input data string (substrings of the data appearing in two or more nonoverlapping positions). The matching pat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the training distortion of vector quantizers

    Publication Year: 2000, Page(s):1617 - 1623
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    The in-training-set performance of a vector quantizer as a function of its training set size is investigated. For squared error distortion and independent training data, worst case type upper bounds are derived on the minimum training distortion achieved by an empirically optimal quantizer. These bounds show that the training distortion can underestimate the minimum distortion of a truly optimal q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of linear codes with good parameters from algebraic curves

    Publication Year: 2000, Page(s):1527 - 1532
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    A class of linear codes with good parameters is constructed in this correspondence. It turns out that linear codes of this class are subcodes of the subfield subcodes of Goppa's geometry codes. In particular, we find 61 improvements on Brouwer's table based on our codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chinese remaindering with errors

    Publication Year: 2000, Page(s):1330 - 1338
    Cited by:  Papers (38)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    The Chinese remainder theorem states that a positive integer m is uniquely specified by its remainder module k relatively prime integers p 1, ···, pk, provided m<Πi=1kpi. Thus the residues of m module relatively prime integers p1<p2<···<pn form a redunda... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A short proof of the “concavity of entropy power”

    Publication Year: 2000, Page(s):1695 - 1696
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (66 KB)

    After a brief statement of the“concavity of entropy power” theorem, a proof is given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimal interpolation problem and decoding RS codes

    Publication Year: 2000, Page(s):1573 - 1580
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    Some properties of the minimal interpolation problem are investigated, from which a simple proof of the validity of the Welch-Berlekamp (1983) algorithm is presented. A new key equation is derived, which is closely related to the classical key equation of the syndrome-decoding algorithm and can be solved by the Welch-Berlekamp algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transform coding with backward adaptive updates

    Publication Year: 2000, Page(s):1623 - 1633
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    The Karhunen-Loeve transform (KLT) is optimal for transform coding of a Gaussian source. This is established for all scale-invariant quantizers, generalizing previous results. A backward adaptive technique for combating the data dependence of the KLT is proposed and analyzed. When the adapted transform converges to a KLT, the scheme is universal among transform coders. A variety of convergence res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some inequalities for information divergence and related measures of discrimination

    Publication Year: 2000, Page(s):1602 - 1609
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Inequalities which connect information divergence with other measures of discrimination or distance between probability distributions are used in information theory and its applications to mathematical statistics, ergodic theory, and other scientific fields. We suggest new inequalities of this type, often based on underlying identities. As a consequence, we obtain certain improvements of the well-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weak variable-length source coding

    Publication Year: 2000, Page(s):1217 - 1226
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Given a general source X={Xn}n=1, source coding is characterized by a pair (φn, ψn) of encoder φn, and decoder ψn , together with the probability of error εn≡Pr{ψnn(Xn ))≠Xn}. If the length of the encoder output φ ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes

    Publication Year: 2000, Page(s):1514 - 1523
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    Linear tail-biting trellises for block codes are considered. By introducing the notions of subtrellis, merging interval, and sub-tail-biting trellis, some structural properties of linear tail-biting trellises are proved. It is shown that a linear tail-biting trellis always has a certain simple structure, the parallel-merged-cosets structure. A necessary condition required from a linear code in ord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On random rotations diversity and minimum MSE decoding of lattices

    Publication Year: 2000, Page(s):1584 - 1589
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    We establish a simple relation between high-diversity multidimensional rotations obtained from totally complex cyclotomic fields and the discrete Fourier transform. The diversity distribution of an Hadamard-like random rotation is derived analytically. It is shown that a random multidimensional rotation exhibits an excellent diversity distribution and can be combined to quadrature amplitude modula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal coding of nonstationary sources

    Publication Year: 2000, Page(s):1633 - 1637
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    We investigate the performance of the Lempel-Ziv (1978) incremental parsing scheme on nonstationary sources. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source. We also show a similar result for a lossy coding scheme given by Yang and Kieffer (see ibid., vol.42, p.239-45, 1996) which uses a Lempel-Ziv scheme to perform lossy coding View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal L1-norm reconstruction function for oversampled signals: applications to time-delay estimation

    Publication Year: 2000, Page(s):1666 - 1673
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    We consider the problem of the reconstruction of an oversampled band-limited signal and obtain an explicit expression for the reconstruction function with minimal L1-norm. It has good sparseness and localization properties that recommends its use in time-delay estimation but the result may be of interest in other domains. Compared to the standard sine cardinal reconstruction function, i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network information flow

    Publication Year: 2000, Page(s):1204 - 1216
    Cited by:  Papers (3647)  |  Patents (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimum distances of Schubert codes

    Publication Year: 2000, Page(s):1535 - 1538
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    Ghorpade and Lachaud (1998) introduced Schubert codes as codes corresponding to the protective system (Tsfasman and Vladut 1991) defined by Schubert subvarieties of Grassmann varieties Gr(l,m). They gave an upper bound for the minimum distances of these codes in Ghorpade and Lachaud and conjectured their true minimum distances. In this note we prove the conjecture in the case of l=2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nested input-constrained codes

    Publication Year: 2000, Page(s):1302 - 1316
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    An input-constrained channel, or simply a constraint, is a set S of words that is generated by a finite labeled directed graph. An encoder for S maps, in a lossless manner, sequences of unconstrained input blocks into sequences of channel blocks, the latter sequences being words of S. In most applications, the encoders are finite-state machines and, thus, presented by state diagrams. In the specia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The smallest length of eight-dimensional binary linear codes with prescribed minimum distance

    Publication Year: 2000, Page(s):1539 - 1544
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Let n(8,d) be the smallest integer n for which a binary linear code of length n, dimension 8, and minimum distance d exists. We prove that n(8,18)=42, n(8,26)=58, n(8,28)=61, n(8,30)=65, n(8,34)=74, n(8,36)=77, n(8,38)=81, n(8,42)=89, and n(8,60)=124. After these results, all values of n(8,d) are known View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A probabilistic approach to some asymptotics in noiseless communication

    Publication Year: 2000, Page(s):1246 - 1262
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    Renewal theory is a powerful tool in the analysis of source codes. We use renewal theory to obtain some asymptotic properties of finite-state noiseless channels. We discuss the relationship between these results and earlier uses of renewal theory to analyze the Lempel-Ziv (1977, 1978) codes and the Tunstall (1967) code. As a new application of our results, we provide the asymptotic performance of ... View full abstract»

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

    Publication Year: 2000, Page(s):1545 - 1550
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    We demonstrate that many well-known binary, quaternary, and q-ary codes are cocyclic Hadamard codes; that is, derived from a cocyclic generalized Hadamard matrix or its equivalents. Nonlinear cocyclic Hadamard codes meet the generalized Plotkin bound. Using presemifield multiplication cocycles, we construct new equivalence classes of cocyclic Hadamard codes which meet the Plotkin bound View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authentication theory and hypothesis testing

    Publication Year: 2000, Page(s):1350 - 1356
    Cited by:  Papers (36)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    By interpreting message authentication as a hypothesis testing problem, this paper provides a generalized treatment of information-theoretic lower bounds on an opponent's probability of cheating in one-way message authentication. We consider the authentication of an arbitrary sequence of messages, using the same secret key shared between sender and receiver. The adversary tries to deceive the rece... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On quantum fidelities and channel capacities

    Publication Year: 2000, Page(s):1317 - 1329
    Cited by:  Papers (83)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    For the discrete memoryless quantum channel, we show the equivalence of two different notions of quantum channel capacity: that which uses the entanglement fidelity as its criterion for success in transmission, and that which uses the minimum fidelity of pure states in a subspace of the input Hilbert space as its criterion. As a corollary, any source with entropy rate less than the capacity may be... 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