IEEE Transactions on Information Theory

This paper provides two theorems for decoding all types of cyclic codes. It is shown that from a polynomial ideal point of view, the decoding problems of cyclic codes are closely related to the monic generators of certain polynomial ideals. This ...

Six new quasi-cyclic codes are presented, which improve the lower bounds on the minimum distance for a binary code. A local exhaustive search is used to find these codes and many other quasi-cyclic codes which attain the lower bounds.

The problem of reconstruction of band-limited signals from discrete and noisy data is studied. The reconstruction schemes employing cardinal expansions are proposed and their asymptotical properties are examined. In particular, the conditions for the ...

Optical direct-detection systems are currently being considered for some high-speed intersatellite links, where data rates of a few hundred megabits per second are envisioned under power and pulsewidth constraints. The authors investigate the capacity, ...

The problem of estimating the symbol timing in wideband data communication signals is considered. Conventional approaches to this problem suffer from several drawbacks, including possible lack of consistency due to multiple extrema in the error surface, ...

The joint transmit-receive optimization problem for multiuser communication systems with decision feedback is investigated. It is shown that minimization of the geometric mean-squared error (defined as the determinant of the error covariance matrix) ...

Proposes a new trellis coded modulation scheme which is constructed by combining a convolutional code and a variation of block coded modulation called block coded modulation with interblock memory. In the proposed scheme, each coded multidimensional ...

The paper presents a new procedure for decoding cyclic and BCH codes up to their actual minimum distance. It generalizes the Peterson decoding procedure and the procedure of Feng and Tzeng (1991) using nonrecurrent syndrome dependence relations. For a ...

Irreducible components of canonical diagrams for spectral null constraints at f=f_sk/n are studied, where k and n are integers and f_s is the symbol frequency. To identify systematically all irreducible components of the canonical diagrams for first-order ...

To decode a long block code with a large minimum distance by maximum likelihood decoding is practically impossible because the decoding complexity is simply enormous. However, if a code can be decomposed into constituent codes with smaller dimensions ...

We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering radius r. All bounds are derived in a uniform way. We employ results from coding theory, some earlier results on covering codes, and combinatorial ...

Based on the idea of integration and differentiation of polynomials, a large class of linear unequal error-protection (LUEP) codes is constructed. Many of these codes are optimal. A codeword is generated by binary discrete integration of an all-zero ...

Let B be the binary two-error-correcting BCH code of length 2^m-1 and let Bˆ be the extended code of B. We give formal expressions of weight distributions of the cosets of the codes Bˆ only depending on m. We can then deduce the weight ...

Limited codes (runlength-limited, charge constrained, and so on) capable of correcting shifts of their symbols are considered. The error-correction ability is characterized by the minimal bitshift distance d_BS of a code. For a given δ=d_BS/n, where ...

Consider the transmission of a finitely interleaved rate 1/n convolutionally encoded message over a channel with memory having two internal states Ξ₀ and Ξ₁ where when in state Ξ₀, the channel resembles a noiseless binary symmetric channel (BSC)...

Systems consisting of linear dynamic and memory-less nonlinear subsystems are identified. The paper deals with systems in which the nonlinear element is followed by a linear element, as well as systems in which the subsystems are connected in parallel. ...

An on-line density estimator may be defined to be one where each update, following the arrival of a new data value, may be accomplished after no more than a fixed number of calculations. This definition should also apply to any empirical bandwidth ...

A kernel-based density estimator for positive random variables is proposed and analyzed. In particular, a nonparametric estimator is developed which takes advantage of the fact that positive random variables can be represented as the norms of random ...

Investigates adaptive waveform selection schemes where selection is based on overall target tracking system performance. Optimal receiver assumptions allow the inclusion of transmitted waveform specification parameters in the tracking subsystem defining ...

Two sensors obtain data vectors x and y, respectively, and transmit real vectors m&oarr;₁(x) and m&oarr;₂(y), respectively, to a fusion center. The authors obtain tight lower bounds on the number of messages (the sum of the dimensions of m&oarr;₁ and m&...

Data compression of independent samples drawn from a fractal set is considered. The asymptotic ratio of rate to magnitude log distortion characterizes the effective dimension occupied by the underlying distribution. This quantity is shown to be ...

The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure ...

The frequently assumed “freshness” constraint on the source states in multiple authentication schemes is not necessary if one allows the encoding rule to change between subsequent transmissions. In the paper it is shown that the main ...

Considers the problem of data detection in multilevel lattice-type modulation systems in the presence of intersymbol interference and additive white Gaussian noise. The conventional maximum likelihood sequence estimator using the Viterbi algorithm has a ...

A finite state Markov random field is observed in Gaussian noise. Changes of measures are defined under which all random variables of the signal are independent and uniformly distributed over the finite state space and all random variables of the ...

Reconstruction of a spectral density function from a finite set of covariances can be performed by maximizing an entropy functional. The method of the maximum entropy on the mean is used For computing a discrete version of this spectral density and ...

Shows that the interdependence of the discrete wavelet coefficients of fractional Brownian motion, defined by normalized correlation, decays exponentially fast across scales and hyperbolically fast along time

Robust detection of known weak signals of unknown amplitude is considered for a class of combined additive and nonadditive noise models and an asymptotically large set of independent observations. This class includes observation models that may have ...

It is well known that orthogonal signal sets approach the channel capacity and reliability function of the infinite bandwidth additive white Gaussian noise channel. It is shown that pseudonoise-modulated orthogonal signals play a similar role for the ...

This paper is concerned with the optimal transmission of a non-Gaussian signal (a non-Gaussian message) through a channel with Gaussian white noise. The coding is assumed to be linear in the signal, but nonlinear in the observation (the channel output). ...