IEEE Transactions on Information Theory

Issue 1 • Jan. 1997

Filter Results

Displaying Results 1 - 25 of 48
  • On the average redundancy rate of the Lempel-Ziv code

    Publication Year: 1997, Page(s):2 - 8
    Cited by:  Papers (57)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (643 KB)

    In this paper, we settle a long-standing open problem concerning the average redundancy r/sub n/ of the Lempel-Ziv'78 (LZ78) code. We prove that for a memoryless source the average redundancy rate attains asymptotically Er/sub n/=(A+/spl delta/(n))/log n+ O(log log n/log/sup 2/ n), where A is an explicitly given constant that depends on source characteristics, and /spl delta/(x) is a fluctuating f... View full abstract»

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

    Publication Year: 1997, Page(s):386 - 390
    Request permission for commercial reuse | PDF file iconPDF (679 KB)
    Freely Available from IEEE
  • Failure of successive refinement for symmetric Gaussian mixtures

    Publication Year: 1997, Page(s):350 - 352
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    We show that information refinement fails for a continuous alphabet source whose input distribution is the symmetric mixture of normal densities with means -μ and μ and common variance σ 2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Golomb rectangles as folded rulers

    Publication Year: 1997, Page(s):290 - 293
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    A correspondence between two-dimensional Golomb rectangles and one-dimensional Golomb rulers is given. Results are translated from rulers to rectangles. The extension of these results to an arbitrary number of dimensions is given. A new bound is developed on the number of ones in a Golomb array of any dimension. Some new optimum Golomb squares, rectangles, and higher dimensional arrays are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the role of mismatch in rate distortion theory

    Publication Year: 1997, Page(s):38 - 47
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    Using a codebook C, a source sequence is described by the codeword that is closest to it according to the distortion measure d0(x,xˆ0). Based on this description, the source sequence is reconstructed to minimize the reconstruction distortion as measured by d1(x,xˆ1), where, in general, d1(x,xˆ1)≠d0(x,x&c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-error-probability for noncoherent orthogonal signals in fading with optimum combining for correlated branch diversity

    Publication Year: 1997, Page(s):263 - 274
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    Due to the interest in wireless personal communications, there has been a lot of research on the performance of receivers with diversity. Most analyses assume the diversity branches are independent. This paper presents an analysis of the bit-error probability for receivers in which the diversity branches are correlated. Noncoherent orthogonal digital modulation (NCODM) with Rician and Rayleigh slo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The computational intractability of training sigmoidal neural networks

    Publication Year: 1997, Page(s):167 - 173
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    We demonstrate that the problem of approximately interpolating a target function by a neural network is computationally intractable. In particular the interpolation training problem for a neural network with two monotone Lipschitzian sigmoidal internal activation functions and one linear output node is shown to be NP-hard and NP-complete if the internal nodes are in addition piecewise ratios of po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The progressive transmission disadvantage

    Publication Year: 1997, Page(s):347 - 350
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    The disadvantage of progressive transmission, compared to transmission in a single step, is analyzed for the high-rate case using a polytope that is self-similar under binary subdivision. This disadvantage is calculated to be 0.3424 dB or 0.057 bit compared to scalar quantization, obtained with a step size of 1 bit per ensemble View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost-perfect polyphase sequences with small phase alphabet

    Publication Year: 1997, Page(s):361 - 363
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    New classes of polyphase sequences with small phase alphabets of size k are presented. These almost-perfect sequences of length N have a vanishing periodic autocorrelation function Θ(τ) for all τ≠0 mod (N/k). The sequences are derived from q-ary m-sequences by a k-valued character operation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On interactive communication

    Publication Year: 1997, Page(s):22 - 37
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1276 KB)

    Ahlswede has previously introduced an abstract correlated source (𝒱×𝒲,S) with outputs (υ, ω)∈S⊂𝒱×𝒲, where persons P𝒱 and P𝒲 observe υ and ω, respectively. More recently, Orlitsky considered the minimal number C m of bits to be transmitted in m rounds to “inform P 𝒲 about ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the generalized Hamming weights of cyclic codes

    Publication Year: 1997, Page(s):299 - 308
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    We prove several results on the generalized Hamming weights (GHW's) of linear codes, particularly for cyclic codes. Based on these and previously known results, we give some efficient algorithms for computing GHW hierarchy of cyclic codes. We give complete weight hierarchy for each of the binary cyclic codes of odd lengths ⩽31. A table of second and third GHW's of binary cyclic codes of odd le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotics of M-hypothesis Bayesian detection

    Publication Year: 1997, Page(s):280 - 282
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    In two-hypothesis detection problems with i.i.d. observations, the minimum error probability decays exponentially with the amount of data, with the constant in the exponent equal to the Chernoff distance between the probability distributions characterizing the hypotheses. We extend this result to the general M-hypothesis Bayesian detection problem where zero cost is assigned to correct decisions, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary odd-periodic complementary sequences

    Publication Year: 1997, Page(s):365 - 367
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    A pair of binary sequences is called complementary if the sum of their aperiodic autocorrelation functions is zero except for zero shift. Such sequences are known for relatively few lengths. This correspondence therefore introduces pairs of binary odd-periodic complementary sequences, which can be constructed using q-ary m-sequences for many more lengths View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New optimal binary linear codes of dimensions 9 and 10

    Publication Year: 1997, Page(s):314 - 316
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    Eighteen new codes are presented which improve the bounds on maximum minimum distance for binary linear codes. They are rate (m-r)/pm, r⩾1, degenerate quasi-cyclic (QC) codes. Based on the known upper bounds, six of these new codes are optimal. In addition, five two-weight QC codes of dimension 8 are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • I-Q TCM: reliable communication over the Rayleigh fading channel close to the cutoff rate

    Publication Year: 1997, Page(s):250 - 262
    Cited by:  Papers (48)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    This paper presents some trellis codes that provide high coding gain to channels with slow, non frequency-selective Rayleigh fading. It is shown that the use of two encoders in parallel-used to specify the in-phase and quadrature components of the transmitted signal-results in greater minimum time diversity than the conventional design in which a single encoder is used. Using this approach-which w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability-based code-search algorithms for maximum-likelihood decoding of block codes

    Publication Year: 1997, Page(s):239 - 249
    Cited by:  Papers (47)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1228 KB)

    Efficient code-search maximum-likelihood decoding algorithms, based on reliability information, are presented for binary Linear block codes. The codewords examined are obtained via encoding. The information set utilized for encoding comprises the positions of those columns of a generator matrix G of the code which, for a given received sequence, constitute the most reliable basis for the column sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The redundancy of source coding with a fidelity criterion. 1. Known statistics

    Publication Year: 1997, Page(s):71 - 91
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1504 KB)

    The problem of redundancy of source coding with respect to a fidelity criterion is considered. For any fixed rate R>0 and any memoryless source with finite source and reproduction alphabets and a common distribution p, the nth-order distortion redundancy Dn(R) of fixed-rate coding is defined as the minimum of the difference between the expected distortion per symbol of any block code... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric estimation of instantaneous frequency

    Publication Year: 1997, Page(s):183 - 189
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    The local polynomial approximation of time-varying phase is used in order to estimate the instantaneous frequency and its derivatives for a complex-valued harmonic signal given by discrete-time observations with a noise. The considered estimators are high-order nonparametric generalizations of the short-time Fourier transform and the Wigner-Ville distribution. The asymptotic variance and bias of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistics of chaotic binary sequences

    Publication Year: 1997, Page(s):104 - 112
    Cited by:  Papers (167)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Statistical properties of binary sequences generated by a class of ergodic maps with some symmetric properties are discussed on the basis of an ensemble-average technique. We give a simple sufficient condition for such a class of maps to produce a fair Bernoulli sequence, that is, a sequence of independent and identically distributed (i.i.d.) binary random variables. This condition is expressed in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning decision rules for pattern classification under a family of probability measures

    Publication Year: 1997, Page(s):154 - 166
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1308 KB)

    In this paper, uniformly consistent estimation (learnability) of decision rules for pattern classification under a family of probability measures is investigated. In particular, it is shown that uniform boundedness of the metric entropy of the class of decision rules is both necessary and sufficient for learnability under each of two conditions: (i) the family of probability measures is totally bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of sequential tests between Poisson processes

    Publication Year: 1997, Page(s):221 - 238
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1424 KB)

    The problem of performance computation for sequential tests between Poisson processes is considered. The average sample numbers and error probabilities of the sequential probability ratio test (SPRT) between two homogeneous Poisson processes are known to solve certain delay-differential equations (DDEs). Exact, numerically stable solutions to these DDEs are developed here, and their asymptotic pro... View full abstract»

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

    Publication Year: 1997, Page(s):136 - 146
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1360 KB)

    The set of all even subgraphs of a connected graph G on p vertices with q edges forms a binary linear code C=CE(G) with parameters [q,q-p+1,g], where g is the girth of G. Such codes were studied systematically by Bredeson and Hakimi (1967) and Hakimi and Bredeson (1968) who were concerned with the problems of augmenting C to a larger [q,k,g]-code and of efficiently decoding such augment... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redundancy of the Lempel-Ziv incremental parsing rule

    Publication Year: 1997, Page(s):9 - 21
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    The Lempel-Ziv codes are universal variable-to-fixed length codes that have become virtually standard in practical lossless data compression. For any given source output string from a Markov or unifilar source, we upper-bound the difference between the number of binary digits needed to encode the string and the self-information of the string. We use this result to demonstrate that for unifilar or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two

    Publication Year: 1997, Page(s):294 - 298
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    The generalized Hamming weights introduced by Wei (1991) have been shown to be fundamental descriptive parameters of a linear block code. They have been found to be useful in certain cryptographic applications and in the studies of minimal trellis diagrams of linear block codes. In this correspondence, we determine the first few and the last few generalized Hamming weights of binary primitive BCH ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced complexity sequence detection for nonminimum phase intersymbol interference channels

    Publication Year: 1997, Page(s):275 - 280
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Controlled intersymbol interference may be used to design bandwidth efficient coded modulation schemes. The performance of the optimum receiver depends only on the free distance of the code and is independent of its phase. Large reductions in receiver complexity are obtained by using reduced search detection techniques like the M-algorithm (MA). However, we show that MA detector performance depend... 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