IEEE Transactions on Information Theory

Issue 4 • Jul 1995

Filter Results

Displaying Results 1 - 25 of 38
  • New directions in the theory of identification via channels

    Publication Year: 1995, Page(s):1040 - 1050
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (728 KB)

    Studies two problems in the theory of identification via channels. The first problem concerns the identification via channels with noisy feedback. Whereas for Shannon's transmission problem the capacity of a discrete memoryless channel does not change with feedback, it is known that the identification capacity is affected by feedback. The authors study its dependence on the feedback channel. They ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rates of convergence of nearest neighbor estimation under arbitrary sampling

    Publication Year: 1995, Page(s):1028 - 1039
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (808 KB)

    Rates of convergence for nearest neighbor estimation are established in a general framework in terms of metric covering numbers of the underlying space. The first result is to find explicit finite sample upper bounds for the classical independent and identically distributed (i.i.d.) random sampling problem in a separable metric space setting. The convergence rate is a function of the covering numb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable-rate tree-structured vector quantizers

    Publication Year: 1995, Page(s):917 - 930
    Cited by:  Papers (17)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (884 KB)

    In general, growth algorithms for optimal tree-structured vector quantizers do not exist. In this paper we show that if the source satisfies certain conditions; namely, that of diminishing marginal returns; optimal growth algorithms do exist. We present such an algorithm and compare its performance with that of other tree growth algorithms. Even for sources that do not meet the necessary condition... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cosets of convolutional codes with short maximum zero-run lengths

    Publication Year: 1995, Page(s):1145 - 1150
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (496 KB)

    Communication systems and storage systems derive symbol synchronization from the received symbol stream. To facilitate symbol synchronization, the channel sequences must have a short maximum zero-run length. One way to achieve this is to use a coset of an (n, k) convolutional code to generate the channel inputs. For k⩽n-2, it is shown that there exist cosets with short maximum zero-run length ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sup-norm approximation bounds for networks through probabilistic methods

    Publication Year: 1995, Page(s):1021 - 1027
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (580 KB)

    We consider the problem of approximating a smooth target function and its derivatives by networks involving superpositions and translations of a fixed activation function. The approximation is with respect to the sup-norm and the rate is shown to be of order O(n-1/2); that is, the rate is independent of the dimension d. The results apply to neural and wavelet networks and extend the wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group detection for synchronous Gaussian code-division multiple-access channels

    Publication Year: 1995, Page(s):1083 - 1096
    Cited by:  Papers (157)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1188 KB)

    The concept of group detection Is introduced to address the design of suboptimum multiuser detectors for code-division multiple-access (CDMA) channels. A group detection scheme consists of a bank of P group detectors, one each for detecting the information symbols of users in each group of a P group partition of the K simultaneously transmitting users. In a parallel group detection scheme, these g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditional entropy-constrained vector quantization: high-rate theory and design algorithms

    Publication Year: 1995, Page(s):901 - 916
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1176 KB)

    The performance of optimum vector quantizers subject to a conditional entropy constraint is studied. This new class of vector quantizers was originally suggested by Chou and Lookabaugh (1990). A locally optimal design of this kind of vector quantizer can be accomplished through a generalization of the well-known entropy-constrained vector quantizer (ECVQ) algorithm. This generalization of the ECVQ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically optimum detection of a weak signal sequence with random time delays

    Publication Year: 1995, Page(s):1169 - 1174
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (392 KB)

    The problem of designing asymptotically optimum detectors for a weak signal sequence with random time delays in the presence of a white Gaussian noise is considered. The multidimensional probability distribution of the time delays is assumed to be known. As a result of asymptotic analysis of the log-likelihood ratio, the asymptotically optimum linear or quadratic detectors and their probability di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper bounds and Hamming spheres under the DC constraint

    Publication Year: 1995, Page(s):1138 - 1145
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (608 KB)

    Upper bounds on the rate of codes in DC-constrained spaces are derived for imbalances 3, 4, and 5. The new bounds are based on the identification and size calculation of the minimal Hamming spheres. A new combination of the Hamming and Plotkin (1960) bounds for constrained spaces is obtained View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of the discrete-time Gaussian channel with delayed feedback

    Publication Year: 1995, Page(s):1051 - 1059
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (412 KB)

    Gives an upper bound on the finite block length capacity of the discrete-time nonstationary Gaussian channel with delayed feedback. With the aid of minimization of a quadratic form, it is proved that the L time-delayed feedback capacity CnFBL(P) and the nonfeedback capacity Cn(P) satisfy Cn(P)⩽CnFBL(P)⩽Cn (P*) whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New optimal ternary linear codes

    Publication Year: 1995, Page(s):1182 - 1185
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (328 KB)

    The class of quasi-twisted (QT) codes is a generalization of the class of quasi-cyclic codes, similar to the way constacyclic codes are a generalization of cyclic codes. In this paper, rate 1/p QT codes over GF(3) are presented which have been constructed using integer linear programming and heuristic combinatorial optimization. Many of these attain the maximum possible minimum distance for any li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiresolution analysis of a class of nonstationary processes

    Publication Year: 1995, Page(s):1010 - 1020
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (808 KB)

    Processing nonstationary signals is an important and challenging problem. We focus on the class of nonstationary processes with stationary increments of an arbitrary order, and place them in a multiscale framework. Unlike other related studies, we concentrate on the discrete-time analysis and derive a number of new results in addition to placing the related existing ones in the same framework. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of average and peak-power-limited quadrature Gaussian channels

    Publication Year: 1995, Page(s):1060 - 1071
    Cited by:  Papers (107)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1068 KB)

    The capacity C(ρa, ρp) of the discrete-time quadrature additive Gaussian channel (QAGC) with inputs subjected to (normalized) average and peak power constraints, ρa and ρp respectively, is considered. By generalizing Smith's results for the scalar average and peak-power-constrained Gaussian channel, it is shown that the capacity achieving... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On calculating Sakrison's rate distortion function for classes of parameterized sources

    Publication Year: 1995, Page(s):1160 - 1163
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (352 KB)

    Sakrison extended Shannon's notion of the rate distortion function to parameterized classes of sources by taking a minimax approach and defining a measure of the minimum rate required for information reconstruction subject to a prescribed fidelity level D. Unfortunately, calculation of Sakrison's rate distortion function may be very difficult because analytic solutions do not generally exist and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding algorithms with input quantization and maximum error correction capability

    Publication Year: 1995, Page(s):1126 - 1133
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (604 KB)

    Decoding that uses soft-decision information but with multiple low-complexity decoders are investigated. These decoders correct only errors and erasures. The structure of the receiver consists of a bank of z demodulators followed by errors- and erasures-correcting decoders operating in parallel. Each demodulator has a threshold for determining when to erase a given symbol. We assign a cost f(&thet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comment on “A rate of convergence result for a universal D-semifaithful code”

    Publication Year: 1995, Page(s):1200 - 1202
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (188 KB)

    In the above paper (see ibid., vol.39, no.3, p.813-20, 1993) Yu and Speed propose a universal pointwise D-semifaithful code whose expected compression ratio, for discrete memoryless sources, approaches the rate-distortion function at a rate O(n-1 log n). They also conjecture that this is the fastest achievable convergence rate for pointwise D-semifaithful codes. In this correspondence, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symmetric capacity and signal design for L-out-of-K symbol-synchronous CDMA Gaussian channels

    Publication Year: 1995, Page(s):1072 - 1082
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (760 KB)

    We consider the symbol-synchronous Gaussian L-out-of-K code-division multiaccess channel, and obtain the capacity region and the upper and lower bounds to the symmetric capacity. The capacity region is found to be the same with or without frame synchronism. The lower bound depends on the signature waveforms through the eigenvalues of the SNR-weighted crosscorrelation matrix. We find a sufficient c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistics of the binary quantizer error in single-loop sigma-delta modulation with white Gaussian input

    Publication Year: 1995, Page(s):931 - 943
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (928 KB)

    Representations and statistical properties of the process e¯ defined by e¯n+1=λ(e¯n+ξn ), are given. Here λ(u):=u-b·sign(u)+m and {ξn}n=0+∞ is Gaussian white noise. The process e¯ represents the binary quantizer error in a model for single-loop sigma-delta modulation. The innovati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coset correlation for sequences with two-valued periodic autocorrelation

    Publication Year: 1995, Page(s):1150 - 1153
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (304 KB)

    Defines a new coset correlation that generalizes previous coset correlation results for m-sequences. This new correlation can be computed in terms of the coset sizes for any sequence that has a two-valued periodic autocorrelation function and that is constant on cosets. Thus the results apply to a larger family of periodic sequences than just m-sequences View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Leech lattice, the octacode, and decoding algorithms

    Publication Year: 1995, Page(s):1097 - 1106
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (836 KB)

    New multilevel constructions of the Golay code and the Leech lattice are presented. These are derived from the Turyn construction and the “holy construction” with the octacode as the glue code. Further, we show that the “holy construction” of the Leech lattice with the octacode as the glue code is essentially different from the permuted Turyn construction, although both con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiuser signaling in the symbol-synchronous AWGN channel

    Publication Year: 1995, Page(s):1174 - 1178
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (424 KB)

    Multiuser signal set design for the energy-constrained linear real-additive symbol-synchronous additive white Gaussian noise channel is investigated in this correspondence. An argument is presented showing the suboptimality of binary alphabets which, in turn, uncovers a rule for the formation of multiuser signal sets. This simple rule leads to a theorem stating the dimensionality at which addition... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bennett's integral for vector quantizers

    Publication Year: 1995, Page(s):886 - 900
    Cited by:  Papers (67)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1184 KB)

    This paper extends Bennett's (1948) integral from scalar to vector quantizers, giving a simple formula that expresses the rth-power distortion of a many-point vector quantizer in terms of the number of points, point density function, inertial profile, and the distribution of the source. The inertial profile specifies the normalized moment of inertia of quantization cells as a function of location.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes

    Publication Year: 1995, Page(s):1185 - 1191
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (656 KB)

    The trellis complexity of composite-length cyclic codes (CLCC's) is addressed. We first investigate the trellis properties of concatenated and product codes in general. Known factoring of CLCC's into concatenated subcodes is thereby employed to derive upper bounds on the minimal trellis size and state-space profile. New decomposition of CLCC's into product subcodes is established and utilized to d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Threshold detection in correlated non-Gaussian noise fields

    Publication Year: 1995, Page(s):976 - 1000
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1728 KB)

    Classical threshold detection theory for arbitrary noise and signals, based on independent noise samples, i.e., using only the first-order probability density of the noise, is generalized to include the critical additional statistical information contained in the (first-order) covariances of the noise. This is accomplished by replacing the actual, generalized noise by a “quasi-equivalent&rdq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robustness of decentralized tests with ϵ-contamination prior

    Publication Year: 1995, Page(s):1164 - 1169
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (440 KB)

    We consider a decentralized detection problem where the prior density is not completely known, but is assumed to belong to an ε-contamination class. The expressions for the infimum and the supremum of the posterior probability that the parameter under question is in a given region, as the prior varies over the ε-contamination class, are derived. Numerical results are obtained for a speci... 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