than two symbols,no such general relation exists; in particular, ,#d# = 0 mayormay not lead to M#d#=0. This linear,but not general,independence between symbols separated by a distance is studied for ternary sequences. Also included in this paper is the estimation of the #nite-size e

This note is dedicated to the memory of our teacher E.W. Dijkstra, since he would have appreciated the problem and would probably have solved it nicer than we can do below. Our problem is about three ascending sequences of numbers. It was inspired by [2], exercise C-3.1 (p. 213), which is about two

complementary set based UWB signaling employing a set of orthogonal chip pulses is proposed. Each user transmits the same information bit over a set of parallel channels each characterized by an orthogonal pulse and a spreading sequence from a ternary complementary set. Ternary complementary sets

Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths l except for 5, 7, 9, 10, 14, and 17. Our proof reveals an interesting connection between

numbers( L=NS),that means the sequence can be easily implemented by interleaving S subsequences, each of length S.Therefore, the methods to develop multilevel sequence with interleaved structure draw a lot of attentions [3, 4]. In this contribution, a method for design and analysis of ternary m-sequences

sequences over the set fa; b; cg. This fact implies, via König's Infinity Lemma, the existence of an infinite ternary sequence without repetitions of any length. In this

The average complexity analysis for a formalism pertaining pairs of compatible sequences is presented. The analysis is done in two levels, so that an accurate estimate is achieved. The way of separating the candidate pairs into suitable classes of ternary sequences is interesting, allowing the use

Abstract not found

ained by the van der Corput method are presented in the monographs by S. W. Graham and G. Kolesnik [10], A. Ivic [14], E. Kratzel [22], and also in the paper by M. N. Huxley [27]. After a principally new approach to these problems, which appeared in 80th in the paper by A. A. Karatsuba (see [15] and also [16]) and then in papers by E. Bombiery and H. Iwaniec [5, 6], there appears a series of papers in which early results are improved. We also note that the behavior of trigonometrical sums of the van der Corput type was studied by J.-M. Deshouillers [12] with the help of a computer. The problem solved in the dissertation by A. Zakzak [13] is the closest object of study to the present paper. This author found the asymptotic formula for the mean value of the Dirichlet divisor function. In other words, for 1 < c < 100=87, he obtained the asymptotic formula X nT ([n c ]) =<F11.52

Abstract not found