Results 11  20
of
246
Mutual Information Functions versus Correlation Functions
 Journal of Statistical Physics
, 1990
"... This paper studies one application of mutual information to symbolic sequence: the mutual information function M#d#. This function is compared with the more frequently used correlation function ,#d#. An exact relation between M#d# and ,#d# is derived for binary sequences. For sequences with more ..."
Abstract

Cited by 98 (15 self)
 Add to MetaCart
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 #nitesize e
Ternary search whh303 – 1
"... 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 C3.1 (p. 213), which is about two ..."
Abstract
 Add to MetaCart
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 C3.1 (p. 213), which is about two
Ternary Complementary Sets for Orthogonal Pulse based UWB Abstract — Ternary
"... 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 as ..."
Abstract
 Add to MetaCart
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
On ternary squarefree circular words
"... Circular words are cyclically ordered finite sequences of letters. We give a computerfree proof of the following result by Currie: squarefree 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 ter ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Circular words are cyclically ordered finite sequences of letters. We give a computerfree proof of the following result by Currie: squarefree 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
Design and Analysis of Ternary msequences with Interleaved Structure by dTransform
"... Multilevel sequences find more and more applications in modern modulation schemes [4QPSK, 8QPSK,16QAM..] for the 3G,4G system air interface [1,2].Furthermore, in modern cryptography they are also widerly used. It is also interesting to point out that the length L of these sequences are composite nu ..."
Abstract
 Add to MetaCart
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 msequences
ThueLike Sequences and Rainbow Arithmetic Progressions
 ELECTRONIC J. COMBINATORICS
, 2002
"... A sequence u = u 1 u 2 :::u n is said to be nonrepetitive if no two adjacent blocks of u are exactly the same. For instance, the sequence abcbcba contains a repetition bcbc, while abcacbabcbac is nonrepetitive. A well known theorem of Thue asserts that there are arbitrarily long nonrepetitive seq ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
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
On the Average Complexity for the Verification of Compatible Sequences
, 2011
"... 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 o ..."
Abstract
 Add to MetaCart
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
On the Mean Value of the Ternary Function of Divisors on a Sparse Sequence
 in: Proc. of Int. Scienti Reading on Analytic Number Theory and Applications
, 1997
"... 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] an ..."
Abstract
 Add to MetaCart
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
Results 11  20
of
246