IEEE Transactions on Information Theory

Binary prefix codes with the constraint that each codeword must end with a “1” have been recently introduced by Berger and Yeung (1990). We analyze the performance of such codes by investigating their average codeword length. In particular, ...

Describes a (d,k)=(1,8) runlength-limited (RLL) rate 8/12 code with fixed codeword length 12. The code is block-decodable; a codeword can be decoded without knowledge of preceding or succeeding codewords. The code belongs to the class of bounded delay ...

Bounds on the error probability of maximum likelihood decoding of a binary linear code are considered. The bounds derived use the weight spectrum of the code and they are tighter than the conventional union bound in the case of large noise in the ...

The Van Wee bound gives a lower bound on the cardinality of (block) codes with a prescribed covering radius. The author presents an improvement of this bound for binary linear codes and compares the results with other bounds mentioned in the literature. ...

Presents constructions and infinite families of binary linear covering codes with covering radii R=2,3,4. Using these codes, the authors obtain a table of constructive upper bounds on the length function l(r,R) for r⩽64 and R=2,3,4, where l(r, R) is ...

Further results on the upper bounds for difference triangle sets (DTS) are derived from disjoint difference sets and additive sequences of permutations, which greatly improve the known bounds

The main conjecture of this article is the following: if a cyclic (v=4n-1, k=2n-1, λ=n-1) Hadamard difference set exists, the the value of v must be either a prime, or a product of “twin primes,” or one less than a power of 2. Six ...

It is shown that the sum capacity of the symbol-synchronous code-division multiple-access channel with equal average-input-energy constraints is maximized precisely by those spreading sequence multisets that meet Welch's lower bound on total squared ...

The cross-correlation function of p-ary (p prime) GMW sequences is investigated. The well-known m-sequences are incorporated in these sequences. GMW sequences also have the two-level autocorrelation function, but their linear span may be much larger ...

An n-phase Barker sequence can be easily distinguished from the time-shifted versions of itself. This property is important for such applications as radar systems, synchronization systems, and spread-spectrum communications systems. The authors study ...

The Fano inequality gives a lower bound on the mutual information between two random variables that take values on an M-element set, provided at least one of the random variables is equiprobable. The authors show several simple lower bounds on mutual ...

If p_i(i=1,···, N) is the probability of the ith letter of a memoryless source, the length l_i of the corresponding binary Huffman codeword can be very different from the value -log p_i. For a typical letter, however, l_i≈-logp_i. ...

Investigates the maximization of the differential entropy h(X+Y) of arbitrary dependent random variables X and Y under the constraints of fixed equal marginal densities for X and Y. We show that max[h(X+Y)]=h(2X), under the constraints that X and Y have ...

New lower and upper bounds on a maximal achievable rate fur runlength-limited codes, capable of correcting any combination of bit-shift errors (i.e. a zero-error capacity of the bit-shift channel), are presented. The lower bound is a generalization of ...

Presents an upper bound on the zero-error list-coding capacity of discrete memoryless channels. Using this bound, we show that the list-3 capacity of the 4/3 channel is at most 0.3512 bits, improving the best previous bound. The relation of the bound to ...

A sequence of binary (±1) random variables is generated by sampling a hard-limited version of a bandlimited process at n times the Nyquist rate. The information rate ℐ carried by these binary samples is investigated. It is shown by ...

The paper deals with high-order moment-ergodic properties of a complex process composed of superimposed sinusoids. This is efficiently achieved using a state-space representation of the signal and Kronecker algebra. First, a simple formulation of the ...

The cell averaging constant false alarm rate detector has been assumed to be optimal for detecting Swerling I targets embedded in exponential clutter and noise of unknown power. This is because the detector uses a minimum variance unbiased estimate (...

Addresses the harmonic retrieval problem in colored noise. As contrasted to the reported studies in which Gaussian noise was assumed, this paper focuses on additive non-Gaussian ARMA noise. Our approach is hybrid in the sense that third-order cumulants ...

Dembo et al. (see ibid., vol. 35, pp. 1206-1212, 1989) showed that an N×N positive definite Toeplitz matrix T could be embedded in a 2M×2M nonnegative definite circulant matrix S with M=O[κ(T)N ²]. This paper shows that the size of the ...

An approximate steepest descent strategy is described, converging in families of regular exponential densities to maximum likelihood estimates of density functions. These density estimates are also obtained by an application of the principle of minimum ...

Lower bounds on achievable convergence rates of parameter estimators towards the true parameter are derived via universal coding considerations. It is shown that for a parametric class of finite-alphabet information sources, if there exists a universal ...

We give a recursive algorithm to calculate submatrices of the Cramer-Rao (CR) matrix bound on the covariance of any unbiased estimator of a vector parameter θ_. Our algorithm computes a sequence of lower bounds that converges monotonically ...

This paper addresses a signal detection problem based on a class of quantizers. The known moments of the underlying noise distribution are used to index a set of quantization points that have been predetermined under an assumed noise model. The fact ...

The concept of stochastic complexity developed by Rissanen(1989) leads to consistent probability density estimators. These density estimators are defined to achieve the best compromise between likelihood and simplicity, namely, the stochastic complexity ...

We consider first the estimation of the order, i.e., the number of states, of a discrete-time finite-alphabet stationary ergodic hidden Markov source (HMS). Our estimator uses a description of the observed data in terms of a uniquely decodable code with ...

The effect that large propagation delay has on the problem of network access is explored for the infinite population model with success-idle-collision feedback information, where the feedback information suffers a large propagation delay N. A simple ...

A formula for the capacity of arbitrary single-user channels without feedback (not necessarily information stable, stationary, etc.) is proved. Capacity is shown to equal the supremum, over all input processes, of the input-output inf-information rate ...

A spherical code is a finite set X of points lying on the unit sphere of Rⁿ. For such a set, we define ρ(X) as the minimum of the squared distances ||x-y||², when x, y∈X and x≠y. Define R(ρ)=lim sup n→∞, ρ(X)=p log₂CardX/...

We develop a computationally efficient soft-decision Reed-Solomon (RS) decoding algorithm. Our new algorithm has direct applications to soft-decision decoding procedures such as the generalized-minimum-distance decoding algorithm. Our particular soft-...