Scheduled Maintenance on August 31st, 2016:
IEEE Xplore will undergo system maintenance from 1:00 - 3:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

IEEE Transactions on Information Theory

Issue 7 • Date Nov. 1999

Filter Results

Displaying Results 1 - 25 of 63
  • Multicast-based inference of network-internal loss characteristics

    Publication Year: 1999, Page(s):2462 - 2480
    Cited by:  Papers (165)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    Robust measurements of network dynamics are increasingly important to the design and operation of large internetworks like the Internet. However, administrative diversity makes it impractical to monitor every link on an end-to-end path. At the same time, it is difficult to determine the performance characteristics of individual links from end-to-end measurements of unicast traffic. In this paper, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels

    Publication Year: 1999, Page(s):2582 - 2591
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    The multilevel coding approach of Imai and Hirakawa (1977) is used to construct trellis-matched codes for binary-input partial-response channels. For the codes to be trellis matched, the signal constellations are selected according to certain constraints, but no conditions are imposed on the component codes. New codes for the (1-D)(1+D)/sup n/ channel compare favorably to existing codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Addendum and correction to "Optimal phases for a family of quadriphase CDMA sequences"

    Publication Year: 1999, Page(s):2672 - 2673
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    This correspondence presents several corrections and an addendum to the original article by Feng-Wen Sun and H. Leib (see ibid., vol.43, no.4, p.1205-17, July 1997). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1997-1999 Index IEEE Transactions on Information Theory Vols. 43-45

    Publication Year: 1999, Page(s):1 - 72
    Request permission for commercial reuse | PDF file iconPDF (875 KB)
    Freely Available from IEEE
  • Minimax nonparametric classification. II. Model selection for adaptation

    Publication Year: 1999, Page(s):2285 - 2292
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    For pt.I see ibid., vol.45, no.7, p.2271-84 (1999). We study nonparametric estimation of a conditional probability for classification based on a collection of finite-dimensional models. For the sake of flexibility, different types of models, linear or nonlinear, are allowed as long as each satisfies a dimensionality assumption. We show that with a suitable model selection criterion, the penalized ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax nonparametric classification .I. Rates of convergence

    Publication Year: 1999, Page(s):2271 - 2284
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    This paper studies minimax aspects of nonparametric classification. We first study minimax estimation of the conditional probability of a class label, given the feature variable. This function, say f, is assumed to be in a general nonparametric class. We show the minimax rate of convergence under square L2 loss is determined by the massiveness of the class as measured by metric entropy.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear models for a time-variant permutation generator

    Publication Year: 1999, Page(s):2374 - 2382
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    A keystream generator, known as RC4, consisting of a permutation table that slowly varies in time under the control of itself, is analyzed by the linear model approach. The objective is to find linear relations among the keystream bits that hold with probability different from one half by using the linear sequential circuit approximation method. To estimate the corresponding correlation coefficien... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MEM pixel correlated solutions for generalized moment and interpolation problems

    Publication Year: 1999, Page(s):2253 - 2270
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    In generalized moment problems (signed) measures are searched to fit given observations, or continuous functions are searched to fit given constraints. Known convex methods for solving such problems, and their stochastic interpretations via maximum entropy on the mean (MEM) and in a Bayesian sense are reviewed, with some improvements on previous results. Then the MEM and Bayesian approaches are ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sort-and-match algorithm for soft-decision decoding

    Publication Year: 1999, Page(s):2333 - 2338
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    Let a q-ary linear (n, k) code C be used over a memoryless channel. We design a decoding algorithm ΨN that splits the received block into two halves in n different ways. First, about √N error patterns are found on either half. Then the left- and right-hand lists are sorted out and matched to form codewords. Finally, the most probable codeword is chosen among at most n√N ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal propagation and noisy circuits

    Publication Year: 1999, Page(s):2367 - 2373
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    The information carried by a signal decays when the signal is corrupted by random noise. This occurs when a message is transmitted over a noisy channel, as well as when a noisy component performs computation. We first study this signal decay in the context of communication and obtain a tight bound on the rate at which information decreases as a signal crosses a noisy channel. We then use this info... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Newton and covering radii of linear codes

    Publication Year: 1999, Page(s):2534 - 2536
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    The Newton radius of a code is the largest weight of a uniquely correctable error. The covering radius is the largest distance between a vector and the code. Two relations between the Newton radius and the covering radius are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polyspectra of ordered signals

    Publication Year: 1999, Page(s):2239 - 2252
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    Polyspectra are related to Fourier transforms of moment or cumulant functions of any order of random signals. They play an important role in many problems of signal analysis and processing. However, there are only a few statistical models giving explicitly the expression of polyspectra. Ordered signals are signals for which the explicit expression of the moment functions requires that the time ins... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the decoding of convolutional codes on an unknown channel

    Publication Year: 1999, Page(s):2321 - 2332
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    An algorithm is proposed for universal decoding of convolutional/trellis codes employed over unknown channels. On discrete memoryless channels and at rates below the channel's computational cutoff rate (for a uniform input distribution), the algorithm achieves an asymptotic complexity-performance tradeoff similar to the tradeoff achieved by the Viterbi (1979) algorithm, but with the benefit that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum shadow enumerators

    Publication Year: 1999, Page(s):2361 - 2366
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    In a previous paper, Shor and Laflamme (see Phys. Rev. Lett., vol.78, p.1600-02, 1997) define two “weight enumerators” for quantum error-correcting codes, connected by a MacWilliams (1977) transform, and use them to give a linear-programming bound for quantum codes. We extend their work by introducing another enumerator, based on the classical theory of shadow codes, that tightens thei... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monotonicity of the quantum linear programming bound

    Publication Year: 1999, Page(s):2489 - 2492
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    The most powerful technique known at present for bounding the size of quantum codes of prescribed minimum distance is the quantum linear programming bound. Unlike the classical linear programming bound, it is not immediately obvious that if the quantum linear programming constraints are satisfiable for dimension K, then the constraints can be satisfied for all lower dimensions. We show that the qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved lower bounds for multicovering codes

    Publication Year: 1999, Page(s):2532 - 2534
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    The m-covering radius of a code is a generalization of the covering radius of a code. It is the smallest t such that every m-tuple of vectors is contained in a ball of Hamming radius t centered at some codeword. We derive new lower bounds for the size of the smallest code that has a given length and m-covering radius View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On denoising and best signal representation

    Publication Year: 1999, Page(s):2225 - 2238
    Cited by:  Papers (109)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    We propose a best basis algorithm for signal enhancement in white Gaussian noise. The best basis search is performed in families of orthonormal bases constructed with wavelet packets or local cosine bases. We base our search for the “best” basis on a criterion of minimal reconstruction error of the underlying signal. This approach is intuitively appealing, because the enhanced or estim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code

    Publication Year: 1999, Page(s):2522 - 2524
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    Using tensor product constructions for the first-order generalized Reed-Muller codes, we extend the well-established concept of the Gray isometry between (Z4, δL) and (Z2 2, δH) to the context of finite chain rings. Our approach covers previous results by Carlet (see ibid., vol.44, p.1543-7, 1998), Constantinescu (see Probl. Pered.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Several classes of binary sequences with three-level autocorrelation

    Publication Year: 1999, Page(s):2606 - 2612
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    In this correspondence we describe several classes of binary sequences with three-level autocorrelation. Those classes of binary sequences are based on cyclic almost difference sets. Some classes of binary sequences have optimum autocorrelation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear-time binary codes correcting localized erasures

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

    We consider a communication model over a binary channel in which the transmitter knows which bits of the n-bit transmission are prone to loss in the channel. We call this model channel with localized erasures in analogy with localized errors studied earlier in the literature. We present two constructions of binary codes with t(1+ε) check bits, where t=αn is the maximal possible number o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On coherent reception of uplink transmitted signals in the DS-CDMA system

    Publication Year: 1999, Page(s):2655 - 2661
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    Coherent reception of quadrature phase-shift keying (QPSK) modulated signals in an uplink channel of a direct-sequence code-division multiple access (DS-CDMA) system is considered. The receivers, commonly referred as the conventional matched-filter receiver and the RAKE receiver, are analyzed when the transmission of data is performed over the additive white Gaussian noise (AWGN) channel and the m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantization based on a novel sample-adaptive product quantizer (SAPQ)

    Publication Year: 1999, Page(s):2306 - 2320
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    In this paper, we propose a novel feedforward adaptive quantization scheme called the sample-adaptive product quantizer (SAPQ). This is a structurally constrained vector quantizer that uses unions of product codebooks. SAPQ is based on a concept of adaptive quantization to the varying samples of the source and is very different from traditional adaptation techniques for nonstationary sources. SAPQ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Type IV self-dual codes over rings

    Publication Year: 1999, Page(s):2345 - 2360
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    We study Type IV self-dual codes over the commutative rings of order 4. Gleason-type theorems of Type IV codes and their shadow codes are investigated. A mass formula of Type IV codes over these rings are given. We give a classification of Type TV codes over Z4 and F2+uF2 for reasonable lengths. We also construct a number of optimal Type TV codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimal weight of some singly-even codes

    Publication Year: 1999, Page(s):2539 - 2541
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    It is shown that the minimal distance d of a singly-even self-dual [24t+8, 12t+4] code is at most 4t+2 if its shadow contains a weight 4 vector, t is even, and (t5t) is odd. It is proved particularly that there does not exist a [56, 28, 12] singly even self-dual code with 4862 words of weight 12. This answers a question raised by Conway and Sloane (see ibid., vol.36, p.1319-3... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On binary constructions of quantum codes

    Publication Year: 1999, Page(s):2495 - 2498
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    We improve estimates on the parameters of quantum codes obtained by Steane's (see ibid., vol.45, no.7, p.2492-5, 1999) construction from binary codes. This yields several new families of quantum codes 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