By Topic

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
  • 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.
  • A note on permutation modulation

    Publication Year: 1997, Page(s):359 - 360
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    Slepian (1962) observed that the code points in an n-dimensional variant-1 permutation modulation code actually lie in an n-1-dimensional subspace. In this correspondence, a change of coordinates which gives the representation explicitly in n-1 dimensions is derived. Slepian's optimum decoding algorithm can be adapted to the codes in this form using an idea of Biglieri and Elia (1976) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice vector quantization of generalized Gaussian sources

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

    Many important sources of data including sub-band image and speech coefficients are highly peaked and can be well-modeled by the family of generalized Gaussian (GG) PDFs parameterized by a shape parameter ν. We present here algorithms for defining and quantizing to a Z lattice in which the boundary is optimized to the characteristics of GG sources, and show that these techniques lead to high pe... 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.
  • Optimal permutation codes for the Gaussian channel

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

    This correspondence contains a continuation of the table contained in Karlof (1989) listing the minimum distance of optimal permutation codes generated by primitive permutation groups of degree less than or equal to 20. We use a nonlinear programming algorithm developed using geometric programming techniques View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block-coded modulation optimized for finite error rate on the white Gaussian noise channel

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

    This correspondence examines the performance of block-coded modulation (BCM) at finite decoded bit error rates (BER). We consider the optimum geometric structure to optimize coding gain at finite BER, rather than asymptotic coding gain. We introduce the concept of the “row BER” and show that this structure may be implemented by a BCM scheme in which the row bit-error rates are equalize... 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.
  • Almost-MDS and near-MDS codes for error detection

    Publication Year: 1997, Page(s):285 - 290
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    The error detection capability of almost-MDS (AMDS) and nearly-MDS (NMDS) codes is studied. Necessary and sufficient conditions for the codes to be proper or good for error detection are given 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.
  • Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals. II. Large space-bandwidth product asymptotics

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

    For pt.I see ibid., vol.43, no.1, p.190-207 (1997). We consider the sampling of bandlimited spatiotemporal signals subject to the time-sequential (TS) constraint that only one spatial position can be sampled at any given time. Part I of this paper developed a new unifying theory linking TS sampling with generalized multidimensional sampling. It provided a complete characterization of time-sequenti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency of orthogonal series density estimators based on grouped observations

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

    In this correspondence we show that nonparametric orthogonal series estimators of probability densities retain the mean integrated square error (MISE) consistency when observations are grouped to the points of a uniform grid (prebinned). This kind of grouping is typical for computer rounding errors and may also be useful in data compression, before calculating estimates, e.g., using the FFT. The m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A forbidden rate region for generalized cross constellations

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

    An analysis of the generalized cross constellation (GCC) is presented and a new perspective on its coding algorithm is described. We show how the GCC can be used to address generic sets of symbol points in any multidimensional space through an example based on the matched spectral null coding used in magnetic recording devices. We also prove that there is a forbidden rate region of fractional codi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals. I

    Publication Year: 1997, Page(s):190 - 207
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1892 KB)

    We consider the sampling of bandlimited spatiotemporal signals subject to the time-sequential (TS) constraint that only one spatial position can be sampled at any given time. Using the powerful techniques of lattice theory, we develop a new unifying theory linking TS sampling with generalized multidimensional sampling. The results have a geometric nature, involving simultaneous packing of the spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characteristics of guided scrambling encoders and their coded sequences

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

    We derive several properties of guided scrambling (GS) encoders and the sequences they generate. We first highlight symmetrical aspects of the GS encoding mechanisms proposed to date, and then show that the existence of discrete components in the power spectrum of the pulse-amplitude-modulated encoded sequence can be predicted from the weight of the scrambling polynomial. We also show that with eq... 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.
  • 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.
  • 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.
  • 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.
  • Rate distortion efficiency of subband coding with crossband prediction

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

    Traditional subband coding, where each subband is encoded independently, has been shown by Fischer (1992) to be suboptimum for encoding Gaussian sources in the rate-distortion sense. We show here that if we use prediction across subbands when encoding Gaussian sources, the resulting coder is asymptotically rate-distortion-optimum at high rate. We also show for Gauss-Markov sources that although th... 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.
  • How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback

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

    Pippenger (1981) showed in a probabilistic way that the capacity of a collision channel with multiplicity feedback is one. In this correspondence, using an Erdos-Renyi type search strategy, we settle a long-standing open problem by giving a constructive proof of this result. Moreover, we prove that two different capacity definitions are equivalent, thereby solving a problem posed by Tsybakov (1985... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification via compressed data

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

    A new coding problem is introduced for a correlated source (Xn,Yn)n=1∞. The observer of Xn can transmit data depending on Xn at a prescribed rate R. Based on these data the observer of Yn tries to identify whether for some distortion measure ρ (like the Hamming distance) n-1 ρ(Xn,Y 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.

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