IEEE Transactions on Information Theory

Volume 46 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
  • A new recursive universal code of the positive integers

    Publication Year: 2000, Page(s):717 - 723
    Cited by:  Papers (3)
    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.
  • Source code with cost as a nonuniform random number generator

    Publication Year: 2000, Page(s):712 - 717
    Cited by:  Papers (7)  |  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.
  • Asymptotic minimax regret for data compression, gambling, and prediction

    Publication Year: 2000, Page(s):431 - 445
    Cited by:  Papers (63)
    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.
  • Entropy expressions for multivariate continuous distributions

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

    Analytical formulas for the entropy and the mutual information of multivariate continuous probability distributions are presented 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.
  • Sequential decoding for the exponential server timing channel

    Publication Year: 2000, Page(s):705 - 709
    Cited by:  Papers (15)
    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.
  • On random coding error exponents of watermarking systems

    Publication Year: 2000, Page(s):420 - 430
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    Watermarking codes are analyzed from an information-theoretic viewpoint as a game between an information hider and an active attacker. While the information hider embeds a secret message (watermark) in a covertext message (typically: text, image, sound, or video stream) within a certain distortion level, the attacker processes the resulting watermarked message, within limited additional distortion... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless sliding-block compression of constrained systems

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

    A method is presented for designing lossless sliding-block compression schemes that map constrained sequences onto unconstrained ones. The new compression scheme is incorporated into a coding technique for noisy constrained channels, which has applications to magnetic and optical storage. As suggested previously by Immink (see ibid., vol.43, p.1389-99, 1997), the use of a lossless compression code... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • About priority encoding transmission

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

    Albanese et al. (see ibid. vol.42, p.1737-44, 1996) introduced priority encoding transmission (PET) for sending hierarchically organized messages over lossy packet-based computer networks. In a PET system, each symbol in the message is assigned a priority which determines the minimal number of codeword symbols that is required to recover that symbol. This article revisits the PET approach using to... 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 (28)
    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.
  • Decoding real block codes: activity detection Wiener estimation

    Publication Year: 2000, Page(s):609 - 623
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    New decoding procedures for real-number block codes which are constructed by imposing constraints in the discrete Fourier transform (DFT) domain are examined. The codewords are corrupted by small levels of roundoff noise and possibly occasionally by a few large excursions of random disturbances. The error-correcting procedure is separated into two parts, large activity detection followed by error ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Split group codes

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

    We construct a class of codes of length n such that the minimum distance d outside of a certain subcode is, up to a constant factor, bounded below by the square root of n, a well-known property of quadratic residue codes. The construction, using the group algebra of an Abelian group and a special partition or splitting of the group, yields quadratic residue codes, duadic codes, and their generaliz... 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 (44)
    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.
  • The capacity of wireless networks

    Publication Year: 2000, Page(s):388 - 404
    Cited by:  Papers (4816)  |  Patents (61)
    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.
  • 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.
  • 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.
  • Optimizing the transmit power for slow fading channels

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

    We consider the design of power-adaptive systems for minimizing the average bit-error rate over flat fading channels. Channel state information, obtained through estimation at the receiver, is sent to the transmitter over a feedback channel, where it is used to optimally adapt the transmit power. We consider finite-state optimal policies to reflect the limitations of the feedback channel. We devel... 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 (648)  |  Patents (43)
    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.
  • Sequential multiple hypothesis testing and efficient fault detection-isolation in stochastic systems

    Publication Year: 2000, Page(s):595 - 608
    Cited by:  Papers (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    This paper develops information-theoretic bounds for sequential multihypothesis testing and fault detection in stochastic systems. Making use of these bounds and likelihood methods, it provides a new unified approach to efficient detection of abrupt changes in stochastic systems and isolation of the source of the change upon its detection. The approach not only generalizes previous work in the lit... 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 (19)  |  Patents (10)
    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.
  • 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.
  • 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.
  • 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.
  • Two rank order tests for M-ary detection

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

    We consider a general M-ary detection problem where, given M groups of L samples each, the problem is to identify which unique group of L samples have come from the signal hypothesis. The optimal likelihood ratio test is unrealizable, when the joint distribution of M L samples is not completely known. We consider two rank order types of tests termed the modified rank test (MRT) and the modified ra... 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