By Topic

IEEE Transactions on Information Theory

Issue 2 • March 2000

Filter Results

Displaying Results 1 - 25 of 41
  • Ideals, varieties, and algorithms [Book Review]

    Publication Year: 2000, Page(s):724 - 734
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • The common randomness capacity of a network of discrete memoryless channels

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

    We generalize our previous results on generating common randomness at two terminals to a situation where any finite number of agents, interconnected by an arbitrary network of independent, point-to-point, discrete memoryless channels, wish to generate common randomness by interactive communication over the network. Our main result is an exact characterization of the common randomness capacity of s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Common randomness and secret key generation with a helper

    Publication Year: 2000, Page(s):344 - 366
    Cited by:  Papers (112)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a “helper” terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The generalized distributive law

    Publication Year: 2000, Page(s):325 - 343
    Cited by:  Papers (259)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    We discuss a general message passing algorithm, which we call the generalized distributive law (GDL). The GDL is a synthesis of the work of many authors in information theory, digital communications, signal processing, statistics, and artificial intelligence. It includes as special cases the Baum-Welch algorithm, the fast Fourier transform (FFT) on any finite Abelian group, the Gallager-Tanner-Wib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A relationship between linear complexity and k-error linear complexity

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

    Linear complexity is an important cryptographic criterion of stream ciphers. The k-error linear complexity of a periodic sequence of period N is defined as the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. This article shows a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is stric... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the linear span of an FCSR

    Publication Year: 2000, Page(s):691 - 693
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    We have derived a lower bound on the linear span of a binary sequence generated by a feedback with carry shift register (FCSR) under the following condition: q is a power of a prime such that q=re (e⩾2) and r(=2p+1), where both r and p are 2-prime. This allows us to design FCSR stream ciphers similar to previously proposed linear feedback shift register (LFSR) stream ciphers View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fourier transforms and the 2-adic span of periodic binary sequences

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

    An arithmetic or with-carry analog of Blahut's (1979) theorem is presented. This relates the length of the smallest feedback with-carry shift register to the number of nonzero classical Fourier coefficients of a periodic binary sequence View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the theory of space-time codes for PSK modulation

    Publication Year: 2000, Page(s):524 - 542
    Cited by:  Papers (267)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    The design of space-time codes to achieve full spatial diversity over fading channels has largely been addressed by handcrafting example codes using computer search methods and only for small numbers of antennas. The lack of more general designs is in part due to the fact that the diversity advantage of a code is the minimum rank among the complex baseband differences between modulated codewords, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of Chen's construction of minimum-distance five codes

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

    In 1991, C.L. Chen used the inverted construction Y1 on binary linear codes of minimum Hamming distance five to construct a new [47, 36, 5] code. We examine this construction in depth and show that no such codes are obtained unless the fields GF(8) or GF(32) are used. Using MAGMA, we prove that the binary [11, 4, 5] code and the binary [15, 7, 5] extension found by Chen are the only pos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enumeration and criteria for cyclically shift-distinct GMW sequences

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

    Gordon-Mills-Welch (GMW) sequences (also called cascaded GMW sequences) have two-level autocorrelations. This property makes them widely used in various communication and cryptographic systems. The generation of q-ary GMW sequences of period qn-1 involves three types of parameters. To determine whether GMW sequences are cyclically shift-distinct for differing parameters has remained an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic minimax regret for data compression, gambling, and prediction

    Publication Year: 2000, Page(s):431 - 445
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    For problems of data compression, gambling, and prediction of individual sequences x1, ···, xn the following questions arise. Given a target family of probability mass functions p(x1, ···, x n|θ), how do we choose a probability mass function q(x 1, ···, xn) so tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new recursive universal code of the positive integers

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

    A new recursive universal code of the positive integers is proposed, in which any given sequence can be used as a delimiter of codeword while bit “0” is used as a delimiter in known universal codes, e.g., Levenshtein code, Elias ω code, Even-Rodeh code, Stout code, Bentley-Yao code, etc. The codeword length of the proposed code is shorter than log2n n in alm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum description length induction, Bayesianism, and Kolmogorov complexity

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

    The relationship between the Bayesian approach and the minimum description length approach is established. We sharpen and clarify the general modeling principles minimum description length (MDL) and minimum message length (MML), abstracted as the ideal MDL principle and defined from Bayes's rule by means of Kolmogorov complexity. The basic condition under which the ideal principle should be applie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An upper bound on the minimum Euclidean distance for block-coded phase-shift keying

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

    We present an upper bound on the minimum Euclidean distance dEmin(C) for block-coded PSK. The bound is an analytic expression depending on the alphabet size q, the block length n, and the number of codewords |C| of the code C. The bound is valid for all block codes with q⩾4 and with medium or high rate-codes where |C|>(q/3) n. There are several well-known block codes w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code

    Publication Year: 2000, Page(s):680 - 687
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    In a previous paper, No, Golomb, Gong, Lee and Gaal (see ibid., vol.44, p.814-17, 1998) conjectured that certain binary sequences having a simple trace description possess the ideal autocorrelation property. In the present paper it is shown that each such sequence is balanced and, moreover, that the dual of the linear cyclic code generated by the sequence and its cyclic shifts, is a triple-error c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust decoding for timing channels

    Publication Year: 2000, Page(s):405 - 419
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    To transmit information by timing arrivals to a single-server queue, we consider using the exponential server channel's maximum likelihood decoder. For any server with service times that are stationary and ergodic with mean 1/μ seconds, we show that the rate e -1μ nats per second (capacity of the exponential server timing channel) is achievable using this decoder. We show that a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential decoding for the exponential server timing channel

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

    We show the existence of a good tree code with a sequential decoder for the exponential server timing channel. The expected number of computations before moving one step ahead is upper-bounded by a finite number. The rate of information transfer for this code is μ/(2e) nats per second i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least μ/(2u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading

    Publication Year: 2000, Page(s):543 - 564
    Cited by:  Papers (628)  |  Patents (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Motivated by information-theoretic considerations, we propose a signaling scheme, unitary space-time modulation, for multiple-antenna communication links. This modulation is ideally suited for Rayleigh fast-fading environments, since it does not require the receiver to know or learn the propagation coefficients. Unitary space-time modulation uses constellations of T×M space-time signals (&Ph... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for constructing self-dual codes with an automorphism of order 2

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

    In this paper, we investigate binary self-dual codes with an automorphism of order 2 with c cycles and f fixed points. A method for constructing such codes using self-orthogonal codes of length c and self-dual codes of length f is presented. We apply this method to construct extremal self-dual codes of lengths 40, 42, 44, 52, 54, and 58. Some of them have weight enumerators for which self-dual cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transform coding with integer-to-integer transforms

    Publication Year: 2000, Page(s):465 - 473
    Cited by:  Papers (18)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    A new interpretation of transform coding is developed that downplays quantization and emphasizes entropy coding, allowing a comparison of entropy coding methods with different memory requirements. With conventional transform coding, based on computing Karhunen-Loeve transform coefficients and then quantizing them, vector entropy coding can be replaced by scalar entropy coding without an increase i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source code with cost as a nonuniform random number generator

    Publication Year: 2000, Page(s):712 - 717
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    We show that an optimal source code with a cost function for code symbols can be regarded as a random number generator generating a random sequence (not necessarily a sequence of fair coin bits) as the target distribution in the sense that the normalized conditional divergence between the distribution of the generated codeword distribution and the target distribution vanishes as the block length t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ellipsoidal lists and maximum-likelihood decoding

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

    We study an interrelation between the coverings generated by linear (n,k)-codes and complexity of their maximum-likelihood (ML) decoding. First , discrete ellipsoids in the Hamming spaces E1n are introduced. These ellipsoids represent the sets of most probable error patterns that need to be tested in soft-decision ML decoding. We show that long linear (n,k)-codes surrounded b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DC-free codes of rate (n-1)/n, n odd

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

    We report on a new class of DC-free codes of rate (n-1)/n, odd. The spectral and runlength properties of the new codes have been evaluated by computer simulation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constacyclic codes, cocycles and a u+v|u-v construction

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

    A connection between cohomology, cocycles and constacyclic codes is explored. It suggests an isomorphism between cyclic codes of length mn and a direct sum of m constacyclic codes of length n. The isomorphism is used (i) to study the discrete Fourier transforms and the decomposition of group ring codes; (ii) to give a u+v|u-v construction over GF(q) when q is odd. The u+v|u-v construction gives so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of wireless networks

    Publication Year: 2000, Page(s):388 - 404
    Cited by:  Papers (4438)  |  Patents (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput λ(n) obtainable by each node for a randomly chosen destination is Θ(W/√(nlogn)) bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assign... 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