By Topic

IEEE Transactions on Information Theory

Issue 7 • 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 (170)  |  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
  • On binary constructions of quantum codes

    Publication Year: 1999, Page(s):2495 - 2498
    Cited by:  Papers (34)
    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.
  • Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes

    Publication Year: 1999, Page(s):2397 - 2417
    Cited by:  Papers (456)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    We present a range of coding schemes for OFDM transmission using binary, quaternary, octary, and higher order modulation that give high code rates for moderate numbers of carriers. These schemes have tightly bounded peak-to-mean envelope power ratio (PMEPR) and simultaneously have good error correction capability. The key theoretical result is a previously unrecognized connection between Golay com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enlargement of Calderbank-Shor-Steane quantum codes

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

    It is shown that a classical error correcting code C=[n,k,d] which contains its dual, C⊆C, and which can be enlarged to C'=[n,k'>k+1,d'], can be converted into a quantum code of parameters [[n,k+k'-n,min(d,[3d'/2])]]. This is a generalization of a previous construction, it enables many new codes of good efficiency to be discovered. Examples based on classical Bose-Chaudhur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The structure of single-track Gray codes

    Publication Year: 1999, Page(s):2383 - 2396
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    Single-track Gray codes are cyclic Gray codes with codewords of length n, such that all the n tracks which correspond to the n distinct coordinates of the codewords are cyclic shifts of the first track. We investigate the structure of such binary codes and show that there is no such code with 2n codewords when n is a power of 2. This implies that the known codes with 2n-2n co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decoding algorithm with restrictions for array codes

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

    We present a simple and efficient error correction scheme for array-like data structures. We assume that the channel behaves such that each row of a received array is either error-free or corrupted by many symbol errors. Provided that row error vectors are linearly independent, the proposed decoding algorithm can correct asymptotically one erroneous row per redundant row, even without having relia... 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.
  • Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code

    Publication Year: 1999, Page(s):2522 - 2524
    Cited by:  Papers (42)
    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.
  • Some new results on the minimum length of binary linear codes of dimension nine

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

    Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and minimum distance d exists. Using the residual code technique, the MacWilliams identities and the weight distribution of appropriate Reed-Muller codes, we prove that n(9, 64)=133, n(9, 120)⩾244, n(9, 124)=252, and n(9, 184)=371. We also show that puncturing a known [322, 9, 160]-code yields length... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimistic Shannon coding theorems for arbitrary single-user systems

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

    The conventional definitions of the source coding rate and of channel capacity require the existence of reliable codes for all sufficiently large block lengths. Alternatively, if it is required that good codes exist for infinitely many block lengths, then optimistic definitions of source coding rate and channel capacity are obtained. In this work, formulas for the optimistic minimum achievable fix... View full abstract»

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

    Publication Year: 1999, Page(s):2502 - 2505
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    We discuss some previous constructions of codes from algebraic curves due to Xing, Niederreiter and Lam (see ibid., vol.45, no.7, p.2498-2501, 1999), and we investigate their relations with Goppa's (1981) algebraic-geometric codes 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.
  • 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.
  • 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.
  • Quantization based on a novel sample-adaptive product quantizer (SAPQ)

    Publication Year: 1999, Page(s):2306 - 2320
    Cited by:  Papers (13)
    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.
  • 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.
  • Strong converse to the quantum channel coding theorem

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

    A lower bound on the probability of decoding error for a quantum communication channel is presented, from which the strong converse to the quantum channel coding theorem is immediately shown. The results and their derivations are mostly straightforward extensions of the classical counterparts which were established by Arimoto (1973), except that more careful treatment is necessary here due to the ... 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 (14)
    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.
  • 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.
  • Asymptotically good codes correcting insertions, deletions, and transpositions

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

    We present simple, polynomial time encodable and decodable codes which are asymptotically good for channels allowing insertions, deletions, and transpositions. As a corollary, they achieve exponential error probability in a stochastic model of insertion-deletion View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of optimal Type IV self-dual codes over F2+uF2

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

    Previously, Type IV self dual codes over the ring F2+uF 2 of order 4 have been introduced. In this paper, we construct five optimal Type IV self-dual codes which are the first examples of such codes for that length. We also give several new optimal type IV self-dual codes, and Type IV self-dual codes which improve the upper bounds for minimum weights View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On interleaved, differentially encoded convolutional codes

    Publication Year: 1999, Page(s):2572 - 2582
    Cited by:  Papers (32)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    We study a serially interleaved concatenated code construction, where the outer code is a standard convolutional code, and the inner code is a recursive convolutional code of rate 1. We focus on the ubiquitous inner differential encoder (used, in particular, to resolve phase ambiguities), double differential encoder (used to resolve both phase and frequency ambiguities), and another rate 1 recursi... 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