Results 221 to 230 of about 28,982 (257)

On the optimality of ZCZ sequence sets

Proceedings of the Fifth International Workshop on Signal Design and Its Applications in Communications, 2011
Zero correlation zone (ZCZ) sequence sets are aimed for possible applications in the quasi-synchronous code-division multiple access (QS-CDMA) communication systems. In this paper, we first discuss the relationship between the upper bound on the zone length and the upper bound on the set size, which are both derived from the bound given by Tang, Fan ...
Yang Yang 0005, Xiaohu Tang 0004, Guang Gong, Zhengchun Zhou   +3 more
openaire   +1 more source

7 Sequence Sets and Composite Sequences

2022
ABSTRACTThis chapter presents definitions, recognition criteria, and examples of sequence sets and composite sequences within a sequence-stratigraphic framework. This stratigraphic scale provides useful insights into shale-gas and tight-liquid plays with mudstone reservoirs that can be profitably grouped into four families based on stratal stacking at ...
Kevin Bohacs, Remus Lazar, Tim Demko, Jeff Ottmann, Ken Potma   +4 more
openaire   +1 more source

Factorials and the finite sequences of sets

Mathematical Logic Quarterly, 2019
AbstractWe write for the cardinality of the set of finite sequences of a set which is of cardinality . With the Axiom of Choice (), for every infinite cardinal where is the cardinality of the permutations on a set which is of cardinality . In this paper, we show that “ for every cardinal ”  is provable in and this is the best possible result in ...
Nattapon Sonpanow, Pimpen Vejjajiva
openaire   +1 more source

Convergence Formulas for Sequences of Sets

Canadian Journal of Mathematics, 1975
This paper is concerned with the convergence of sequences of subsets of a topological space, as defined by F. Hausdorff [6]. Such a sequence converges if and only if its limit inferior equals its limit superior, where its limit inferior (respectively, superior) is that set each of whose elements satisfies the condition that each of its neighborhoods ...
openaire   +2 more sources

New construction of perfect sequence set and low correlation zone sequence set

Science China Information Sciences, 2013
For a given binary ideal autocorrelation sequence, we construct a perfect sequence set by changing a few bits of the sequence. The set has a large size with respect to the period of its sequences. Based on the constructed perfect sequence set, a new class of low correlation zone sequence sets whose low correlation zone length can be chosen flexibly is ...
Hai Xiong, Longjiang Qu, Chao Li 0002
openaire   +1 more source

BARKER SEQUENCES AND DIFFERENCE SETS

1992
Let \(A=(a_ 1,\dots,a_ v)\) be a binary sequence (i.e. \(a_ i=\mp 1)\) such that the sums \(\gamma=\sum^ v_{i=1}a_ ia_{i+j}\) \((j=1,\dots,v-1)\) reading the indices modulo \(v\) do not depend on \(j\). Associating to \(A\) the set \(D=\{i\mid a_ i=-1\}\) we have a difference set on \(\mathbb{Z}_ v\), obtaining a bijection between such sequences \(A ...
Eliahou, Shalom, Kervaire, Michel
openaire   +3 more sources

Set Intersection and Sequence Matching

2009
In the classical pattern matching problem, one is given a text and a pattern, both of which are sequences of letters, and is required to find all occurrences of the pattern in the text. We study two modifications of the classical problem, where each letter in the text and pattern is a set (Set Intersection Matching problem) or a sequence (Sequence ...
Ariel Shiftan, Ely Porat
openaire   +1 more source

CORRIGENDUM TO "BARKER SEQUENCES AND DIFFERENCE SETS"

1994
Wayne Broughton has pointed out to us that Lemma 2 [Enseign. Math., II. Sér. 38, No. 3/4, 345-382 (1992; Zbl 0777.05024)] in our proof of Turyn's theorem (which says that, if \(D\subset \mathbb{Z}/v\mathbb{Z}\) is a cyclic difference set with parameters \((v,k,\lambda)= (4N^ 2, 2N^ 2- N, N^ 2-N)\), then \(N\) is odd) is incorrect. Indeed, for \(r=3\), \
Eliahou, Shalom, Kervaire, Michel
openaire   +3 more sources

Representations of Sequences of Sets

American Journal of Mathematics, 1949
Everett, C. J., Whaples, G.
openaire   +2 more sources

EQUALITY SETS OF MORPHIC WORD SEQUENCES

International Journal of Foundations of Computer Science, 2012
We study equality sets of mappings. In particular, we study D0L equality sets. If s = (s(n))n≥0 and t = (t(n))n≥0 are D0L sequences, their equality set is defined by E(s,t) = {n ≥ 0 ∣ s(n) = t(n)}. We study various periodicity and decidability questions concerning these sets. We also study HD0L and DT0L equality sets.
openaire   +2 more sources