IEEE Transactions on Information Theory

Issue 4 • July 1996

Filter Results

Displaying Results 1 - 25 of 37
  • Fundamentals of Artificial Neural Networks [Book Reviews]

    Publication Year: 1996
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | |PDF file iconPDF (424 KB)
    Freely Available from IEEE
  • Large families of sequences with near-optimal correlations and large linear span

    Publication Year: 1996, Page(s):1241 - 1248
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (648 KB)

    In order to build spread-spectrum communication systems based on the CDMA paradigm, it is necessary to have large families of binary sequences with low pairwise correlation values. For these systems to have resistance to certain cryptanalytic attacks and resistance to jamming, the sequences must have large linear span. We describe certain families of sequences that have these desirable properties.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum mean-squared error transform coding and subband coding

    Publication Year: 1996, Page(s):1179 - 1192
    Cited by:  Papers (20)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1236 KB)

    Knowledge of the power spectrum of a stationary random sequence can be used for quantizing the signal efficiently and with minimum mean-squared error. A multichannel filter is used to transform the random sequence into an intermediate set of variables that are quantized using independent scalar quantizers, and then inverse-filtered, producing a quantized version of the original sequence. Equal wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some new three-valued crosscorrelation functions for binary m-sequences

    Publication Year: 1996, Page(s):1238 - 1240
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (204 KB)

    In 1972 Niho gave various conjectures about the crosscorrelation between a binary maximum-length linear shift register sequence and a decimation of that sequence by an integer d. We prove that the crosscorrelation function for two new values of d takes on precisely three values and thereby confirm two of Niho's conjectures View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of linear prediction, coding, and spectral estimation from subbands

    Publication Year: 1996, Page(s):1160 - 1178
    Cited by:  Papers (42)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1204 KB)

    Linear prediction schemes make a prediction xˆi of a data sample xi using p previous samples. It has been shown by Woods and O'Neil (1986) as well as Pearlman (1991) that as the order of prediction p→∞, there is no gain to be obtained by coding subband samples. This paper deals with the less well understood theory of finite-order prediction and optimal coding ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical dynamic programming approach to fixed-rate, entropy-coded quantization

    Publication Year: 1996, Page(s):1298 - 1303
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (608 KB)

    In quantization of any source with a nonuniform probability density function, the entropy coding of the quantizer output can result in a substantial decrease in bit rate. A straightforward entropy coding scheme faces us with the problem of variable data rate. A solution in a space of dimensionality N is to select an appropriate subset of elements in the N-fold Cartesian product of a scalar quantiz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 7200-phase generalized Barker sequences

    Publication Year: 1996, Page(s):1236 - 1238
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (224 KB)

    We present 7200-phase generalized Barker sequences with lengths from 19 to 31. Also, we show the number of known M-phase generalized Barker sequences (M=7200), inequivalent under the group of “Barker-preserving transformations”. The autocorrelation values of Barker sequences are also presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional M-PSK trellis codes for fading channels

    Publication Year: 1996, Page(s):1093 - 1108
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (908 KB)

    This paper investigates the code search problem for trellis-coded multidimensional phase modulation for Rayleigh fading channels. New set partitionings for multiple phase-shift keying (M-PSK) are proposed using the effective code length (ECL) and the minimum product distance (PD) as the code design criteria. By using these set-partitionings rules, new multidimensional codes which are optimum for R... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On determining the radar threshold for non-Gaussian processes from experimental data

    Publication Year: 1996, Page(s):1310 - 1316
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (612 KB)

    The problem of detecting radar signals embedded in clutter is an area of great interest. In many radar applications, it is important to set thresholds to achieve a false alarm probability (PF) of 10-5 or lower. Using conventional Monte Carlo techniques, where thresholds are set based on raw percentiles, an extremely large number of samples is required. We use the generalized ... View full abstract»

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

    Publication Year: 1996, Page(s):1152 - 1159
    Cited by:  Papers (171)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (648 KB)

    We present several results regarding the properties of a random vector, uniformly distributed over a lattice cell. This random vector is the quantization noise of a lattice quantizer at high resolution, or the noise of a dithered lattice quantizer at all distortion levels. We find that for the optimal lattice quantizers this noise is wide-sense-stationary and white. Any desirable noise spectra may... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A directed search approach for unit-memory convolutional codes

    Publication Year: 1996, Page(s):1290 - 1297
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (668 KB)

    A set of heuristic algorithms to numerically search for binary unit-memory convolutional codes (UMC) are presented along with a large number of new codes for 2⩽k⩽8 and code rate 1/4⩽R<1. Combinatorial optimization is used which involves selecting and then pairwise-matching column vectors of the two (n,k) UMC tap weight matrices. The column selection problem is that of finding the be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal quaternary linear codes of dimension five

    Publication Year: 1996, Page(s):1228 - 1235
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (516 KB)

    Let dq(n,k) be the maximum possible minimum Hamming distance of a q-ary [n,k,d]-code for given values of n and k. It is proved that d4 (33,5)=22, d4(49,5)=34, d4 (131,5)=96, d4(142,5)=104, d4(147,5)=108, d 4(152,5)=112, d4(158,5)=116, d4(176,5)⩾129, d4(180,5)⩾132, d4(190... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the BCJR trellis for linear block codes

    Publication Year: 1996, Page(s):1072 - 1092
    Cited by:  Papers (135)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1704 KB)

    In this semi-tutorial paper, we will investigate the computational complexity of an abstract version of the Viterbi algorithm on a trellis, and show that if the trellis has e edges, the complexity of the Viterbi algorithm is Θ(e). This result suggests that the “best” trellis representation for a given linear block code is the one with the fewest edges. We will then show that, amo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the accuracy of estimating the parameters of a regular stationary process

    Publication Year: 1996, Page(s):1202 - 1211
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (604 KB)

    Any regular stationary random processes can be represented as the sum of a purely indeterministic process and a deterministic one. This paper considers the achievable accuracy in the joint estimation of the parameters of these two components, from a single observed realization of the process. An exact form of the Cramer-Rao bound (CRB) is derived, as well as a conditional CRB. The relationships be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the convergence of linear stochastic approximation procedures

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

    Many stochastic approximation procedures result in a stochastic algorithm of the form hk+1=hk+1/k(bk-A khk), for all k=1,2,3,... . Here, {bk,k=1,2,3...} is a Rd-valued process, {Ak,k=1,2,3,...} is a symmetric, positive semidefinite R ed×d-valued process, and {hk,k=1... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Hadamard transform-a tool for index assignment

    Publication Year: 1996, Page(s):1139 - 1151
    Cited by:  Papers (64)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1100 KB)

    We show that the channel distortion for maximum-entropy encoders, due to noise on a binary-symmetric channel, is minimized if the vector quantizer can be expressed as a linear transform of a hypercube. The index assignment problem is regarded as a problem of linearizing the vector quantizer. We define classes of index assignments with related properties, within which the best index assignment is f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of set-membership techniques to symbol-by-symbol decoding for binary data-transmission systems

    Publication Year: 1996, Page(s):1285 - 1290
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (656 KB)

    The application of set theory methods to problems in estimation, system identification, and classification is emerging as a viable approach to a number of different problems. This correspondence studies the use of set-membership methods in symbol-by-symbol decoding of binary data in data-transmission systems. Theorems for necessary and sufficient conditions for error-free decoding are presented. F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mass formulas for self-dual codes over Z4 and Fq+uFq rings

    Publication Year: 1996, Page(s):1222 - 1228
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (492 KB)

    We give a mass formula for quaternary self-dual and type II codes and for self-dual codes over Fq+uFq rings. We define type II codes and compute the number of distinct type II codes. We also give formulas for the number of doubly even binary codes, necessary to compute Nd(n), the number of distinct codes of length n, for any dimension n, and conc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group block codes over nonabelian groups are asymptotically bad

    Publication Year: 1996, Page(s):1277 - 1280
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (372 KB)

    It is known that group block codes over nonabelian groups of order less than 32 are asymptotically bad. In this correspondence we extend that result, showing that group block codes over nonabelian groups are asymptotically bad, no matter what the order of the group under consideration is View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity penalty due to ideal zero-forcing decision-feedback equalization

    Publication Year: 1996, Page(s):1062 - 1071
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (952 KB)

    We consider the capacity C of a continuous-time channel with frequency response H(f) and additive white Gaussian noise. If H(f)|-2 behaves like a polynomial of order ρ at high frequencies, we show that the per-symbol capacity approaches ρ/2 nats per channel use at high signal powers. If the receiver uses an ideal zero forcing decision-feedback equalizer (DFE) consisting of a sam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some remarks on an algorithm of Fitzpatrick

    Publication Year: 1996, Page(s):1269 - 1271
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (284 KB)

    Fitzpatrick's algorithm for solving the classical Reed-Solomon key equation is shown to be related to an algorithm for solving the Welch-Berlekamp key equation. It can be made more efficient when decoding binary BCH codes. Its efficiency is about the same as for the Berlekamp-Massey algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polyphase Barker sequences up to length 36

    Publication Year: 1996, Page(s):1248 - 1250
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (284 KB)

    Originally, Barker (1953) presented binary sequences for synchronization purposes in telecommunications. A sequence is called a generalized Barker sequence if the magnitude of all autocorrelation sidelobes is less or equal to one. It is shown that uniform complex sequences up to length 36, meeting the Barker (1953) condition, do exist. Examples are given for length 32-36. The sequences were obtain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum entropy of error estimation for discrete random variables

    Publication Year: 1996, Page(s):1193 - 1201
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (684 KB)

    The principle of minimum entropy of error estimation (MEEE) is formulated for discrete random variables. In the case when the random variable to be estimated is binary, we show that the MEEE is given by a Neyman-Pearson-type strictly monotonous test. In addition, the asymptotic behavior of the error probabilities is proved to be equivalent to that of the Bayesian test View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vanishing distortion and shrinking cells

    Publication Year: 1996, Page(s):1303 - 1305
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (268 KB)

    We establish an asymptotic connection between vanishing rth-power distortion and shrinking cell diameters for vector quantizers with convex cells. As a consequence, a number of shrinking cell conditions may be easily verified by showing that the quantizers in question have distortion tending to zero. This also plays an important role in the asymptotic analysis of a common greedy growing scheme for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A vector quantization approach to universal noiseless coding and quantization

    Publication Year: 1996, Page(s):1109 - 1138
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2420 KB)

    A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may be noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to two-stage coding, in which the... 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