IEEE Transactions on Information Theory

Issue 4 • 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
  • On the minimal interpolation problem and decoding RS codes

    Publication Year: 2000, Page(s):1573 - 1580
    Cited by:  Papers (3)
    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.
  • Performance analysis of hypothesis testing for sparse pairwise interaction point processes

    Publication Year: 2000, Page(s):1357 - 1365
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    The sufficient statistic for performing the likelihood ratio test for pairwise interaction point processes is well-known; however, the evaluation of its performance is a very difficult problem. It is shown that the distribution of the sufficient statistic can be approximated by the distribution of a Poisson-driven shot-noise random variable, which can be readily computed 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 (8)
    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{ψn(φn(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.
  • A class of Sudan-decodable codes

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

    In this article, Sudan's algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-So... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic performance analysis of Bayesian target recognition

    Publication Year: 2000, Page(s):1658 - 1665
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    This article investigates the asymptotic performance of Bayesian target recognition algorithms using deformable-template representations. Rigid computer-aided design (CAD) models represent the underlying targets; low-dimensional matrix Lie-groups (rotation and translation) extend them to particular instances. Remote sensors observing the targets are modeled as projective transformations, convertin... 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 (57)  |  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.
  • There is no ternary [28, 6, 16] code

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

    The existence of a ternary [28, 6, 16] code is considered. We show that without loss of generality, a generator matrix of such a code must satisfy certain conditions. A computer search over all matrices that satisfy these conditions reveals that a ternary [28, 6, 16] code does not exist View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing efficient DC-free runlength-limited block codes for recording channels

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

    A general scheme for DC-free (d,k)-constrained block codes is considered. In this scheme, messages are mapped to nonzero dklr-sequences of fixed length. For any two dklr-sequences, two merging sequences of fixed length and of different weight parities are available such that each one of these sequences can be inserted between the two dklr-sequences to maintain the (d,k) constraint. One of these tw... 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.
  • On the minimum distances of Schubert codes

    Publication Year: 2000, Page(s):1535 - 1538
    Cited by:  Papers (4)
    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.
  • Network information flow

    Publication Year: 2000, Page(s):1204 - 1216
    Cited by:  Papers (4500)  |  Patents (81)
    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.
  • A probabilistic approach to some asymptotics in noiseless communication

    Publication Year: 2000, Page(s):1246 - 1262
    Cited by:  Papers (12)
    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.
  • On similarity codes

    Publication Year: 2000, Page(s):1558 - 1564
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    We introduce a biologically motivated measure of sequence similarity for quaternary N-sequences, extending Hamming similarity. This measure is the sum over the length of the sequences of “alphabetic” similarities at all positions. Alphabetic similarities are defined, symmetrically, on the Cartesian square of the alphabet. These similarities equal zero whenever the two elements differ. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A quantum analog of Huffman coding

    Publication Year: 2000, Page(s):1644 - 1649
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    We analyze a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication. Nevertheless, for the storage of quantum information, we have succeeded in constructing a Huffman coding inspired quantum scheme. The number of computational steps in the encoding and decoding processes of N quantum signals can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sufficiency, classification, and the class-specific feature theorem

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

    A new proof of the class-specific feature theorem is given. The proof makes use of the observed data as opposed to the set of sufficient statistics as in the original formulation. We prove the theorem for the classical case, in which the parameter vector is deterministic and known, as well as for the Bayesian case, in which the parameter vector is modeled as a random vector with known prior probab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptanalysis of RSA with private key d less than N0.292

    Publication Year: 2000, Page(s):1339 - 1349
    Cited by:  Papers (81)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    We show that if the private exponent d used in the RSA (Rivest-Shamir-Adleman (1978)) public-key cryptosystem is less than N 0.292 then the system is insecure. This is the first improvement over an old result of Wiener (1990) showing that when d is less than N0.25 the RSA system is insecure. We hope our approach can be used to eventually improve the bound to d less than N 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 (109)
    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.
  • A solution to linear estimation problems using approximate Karhunen-Loeve expansions

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

    An explicit and efficiently calculable solution is presented to the problem of linear least-mean-squared-error estimation of a signal process based upon noisy observations that is valid for finite intervals. This approach is based on approximate Karhunen-Loeve expansions of a stochastic process and can be extended to estimate a linear operation, in the sense of the quadratic mean, of the signal pr... 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 (24)
    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.
  • Two-dimensional weight-constrained codes through enumeration bounds

    Publication Year: 2000, Page(s):1292 - 1301
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    For a rational α∈(0,1), let 𝒜n×m,α be the set of binary n×m arrays in which each row has Hamming weight αm and each column has Hamming weight αn, where αm and αn are integers. (The special case of two-dimensional balanced arrays corresponds to α=1/2 and even values for n and m.) The redundancy of 𝒜n×m,&alpha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matrices with banded inverses: inversion algorithms and factorization of Gauss-Markov processes

    Publication Year: 2000, Page(s):1495 - 1509
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    The paper considers the inversion of full matrices whose inverses are L-banded. We derive a nested inversion algorithm for such matrices. Applied to a tridiagonal matrix, the algorithm provides its explicit inverse as an element-wise product (Hadamard product) of three matrices. When related to Gauss-Markov random processes (GMrp), this result provides a closed-form factored expression for the cov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The undetected error probability threshold of m-out-of-n codes

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

    The well-known m-out-of-n code Ωnm consists of all binary vectors of length n and weight m. It is known that it is good for error detection (in the technical sense, that is, the probability of undetected error Pud(Ωn m,p)⩽Pud(Ωnm,1/2) for all p, 0⩽p⩽1/2) only for a few small values... 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 (39)  |  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.
  • Towers of function fields and iterated means

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

    Towers of function fields meeting the Drinfeld-Vladut bound with equality were constructed by Gorcal-Stichtenoth (1995, 1996). Modular uniformizations thereof were pointed out by Elkies (1996). We connect this fact to hypergeometric analogs of the arithmetic-geometric mean and related theta series identities discovered by Borweins and Garven 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