IEEE Transactions on Information Theory

Volume 46 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
  • 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.
  • A spread-spectrum communication system protecting information data from interception

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

    This correspondence tries to construct a direct-sequence spread-spectrum multiple-access communication system, so that the difficulty of wiretapping from insiders' and outsiders' attacks increases and the worst case error probability decreases, as much as possible. Bent sequences with optimal periodic correlation properties are assigned to users, as spreading sequences corresponding to secret keys 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 (25)
    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.
  • Error exponents for maximum-likelihood and successive decoders for the Gaussian CDMA channel

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

    Random-coding error exponents are derived for the Gaussian code-division multiple-access (CDMA) channel for the maximum-likelihood and optimum successive decoders. Error exponents not only specify the capacity region of the channel, which is known, but also give lower bounds on the rate of exponential decay of the average probability of error as a function of the block length of random codes. A co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adding a parity-check bit

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

    The article gives a new condition for a q-ary linear code of length n and minimum distance d to be extendable to a code of the same dimension, length n+1, and minimum distance >d 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.
  • 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.
  • The smallest length of eight-dimensional binary linear codes with prescribed minimum distance

    Publication Year: 2000, Page(s):1539 - 1544
    Cited by:  Papers (6)
    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 note on the discrete wavelet transform of second-order processes

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

    Some properties of second-order random processes such as, stationarity and scaling, are characterized via corresponding (multiscale) properties of their discrete wavelet transform. The single scale characterizations valid in the continuous setting do not extend to the discrete setting. Some extensions of these results are also indicated 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 (55)  |  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.
  • Bounds on the state complexity of codes from the Hermitian function field and its subfields

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

    An upper bound on the minimal state complexity of codes from the Hermitian function field and some of its subfields is derived. Coordinate orderings under which the state complexity of the codes is not above the bound are specified. For the self-dual Hermitian code it is proved that the bound coincides with the minimal state complexity of the code. Finally, it is shown that Hermitian codes over fi... 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.
  • 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.
  • On the minimum distances of Schubert codes

    Publication Year: 2000, Page(s):1535 - 1538
    Cited by:  Papers (5)
    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.
  • Minimal L1-norm reconstruction function for oversampled signals: applications to time-delay estimation

    Publication Year: 2000, Page(s):1666 - 1673
    Cited by:  Papers (15)
    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.
  • Optimization of distributed detection systems under the minimum average misclassification risk criterion

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

    A common model for distributed detection systems is that of several separated sensors each of which measures some observable, quantizes it, and communicates to a fusion center the quantized observation. The fusion center collects the quantized observations and takes the decision. The article deals with the design of the quantizers and of the fusion center under a rate constraint. The system of int... 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 (110)
    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.
  • Network information flow

    Publication Year: 2000, Page(s):1204 - 1216
    Cited by:  Papers (4703)  |  Patents (89)
    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.
  • 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.
  • 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.
  • Bounds on the a priori index crossover probabilities for trellis-based channel codes

    Publication Year: 2000, Page(s):1276 - 1291
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    This paper derives truncated union bounds on the a priori index crossover probabilities p(j|i) that result when an n-bit data index i is convolutionally encoded, transmitted over a noisy channel, and decoded with the Viterbi algorithm, giving received index j. The bounds are derived with a modified transfer function technique, using n-stage state transition matrices with symbolic labels. The techn... 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.
  • On random rotations diversity and minimum MSE decoding of lattices

    Publication Year: 2000, Page(s):1584 - 1589
    Cited by:  Papers (23)  |  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.
  • Authentication theory and hypothesis testing

    Publication Year: 2000, Page(s):1350 - 1356
    Cited by:  Papers (58)  |  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.

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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu