Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Family complexity and cross-correlation measure for families of binary sequences
Date
2016-04-01
Author
Winterhof, Arne
Yayla, Oğuz
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
159
views
0
downloads
Cite This
We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al. in 2003 and recently by Gyarmati et al., respectively. More precisely, we estimate the family complexity of a family (e(i, 1,...,) e(i, N)) is an element of {-1,+1}(N), i = 1, ..., F, of binary sequences of length N in terms of the cross-correlation measure of its dual family (e(1, n,...,) e(F, n)) is an element of {-1,+ 1}(F), n = 1,..., N. We apply this result to the family of sequences of Legendre symbols with irreducible quadratic polynomials modulo p with middle coefficient 0, that is, e(i, n) = (n(2)-bi(2))(n=1)((p-1)/2) for i = 1,..., (p - 1)/2, where b is a quadratic nonresidue modulo p, showing that this family as well as its dual family has both a large family complexity and a small cross-correlation measure up to a rather large order.
URI
https://hdl.handle.net/11511/69844
Journal
RAMANUJAN JOURNAL
DOI
https://doi.org/10.1007/s11139-014-9649-5
Collections
Graduate School of Applied Mathematics, Article
Suggestions
OpenMETU
Core
Correlation distribution of a sequence family generalizing some sequences of trachtenberg
Özbudak, Ferruh (2021-08-01)
In this paper, we give a classification of a sequence family, over arbitrary characteristic, adding linear trace terms to the function g(x) = Tr(x(d)), where d = p(2k) - p(k) + 1, first introduced by Trachtenberg. The family has p(n) + 1 cyclically distinct sequences with period p(n) - 1. We compute the exact correlation distribution of the function g(x) with linear m-sequences and amongst themselves. The cross-correlation values are obtained as C-i,C-j(tau) is an element of {-1, -1 +/- p(n+e/2), -1 + p(n)}.
CLUSTER ALGEBRAS AND SEMIPOSITIVE SYMMETRIZABLE MATRICES
Seven, Ahmet İrfan (American Mathematical Society (AMS), 2011-05-01)
There is a particular analogy between combinatorial aspects of cluster algebras and Kac-Moody algebras: roughly speaking, cluster algebras are associated with skew-symmetrizable matrices while Kac-Moody algebras correspond to (symmetrizable) generalized Cartan matrices. Both classes of algebras and the associated matrices have the same classification of finite type objects by the well-known Cartan-Killing types. In this paper, we study an extension of this correspondence to the affine type. In particular, w...
A new lower bound on the family complexity of Legendre sequences
Cakiroglu, Yagmur; Yayla, Oğuz (Springer Science and Business Media LLC, 2020-06-01)
In this paper we study a family of Legendre sequences and its pseudo-randomness in terms of their family complexity. We present an improved lower bound on the family complexity of a family based on the Legendre symbol of polynomials over a finite field. The new bound depends on the LambertWfunction and the number of elements in a finite field belonging to its proper subfield. Moreover, we present another lower bound which is a simplified version and approximates the new bound. We show that both bounds are b...
MUTATION CLASSES OF SKEW-SYMMETRIZABLE 3 x 3 MATRICES
Seven, Ahmet İrfan (2013-05-01)
Mutation of skew-symmetrizable matrices is a fundamental operation that first arose in Fomin-Zelevinsky's theory of cluster algebras; it also appears naturally in many different areas of mathematics. In this paper, we study mutation classes of skew-symmetrizable 3 x 3 matrices and associated graphs. We determine representatives for these classes using a natural minimality condition, generalizing and strengthening results of Beineke-BrustleHille and Felikson-Shapiro-Tumarkin. Furthermore, we obtain a new num...
Local Boundedness of Catlin q-Type
Yazıcı, Özcan (2022-02-01)
In D'Angelo (Ann Math 115:615-637, 1982) introduced the notion of finite type for points p of a real hypersurface M of C-n by defining the order of contact Delta(q)(M, p) of complex-analytic q-dimensional varieties with M at p. Later, Catlin (Ann Math 126(1):131-191, 1987) defined q-type, D-q(M, p) for points of hypersurfaces by considering generic (n - q + 1)-dimensional complex aline subspaces of C-n. We define a generalization of the Catlin's q-type for an arbitrary subset M of C-n in a similar way that ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Winterhof and O. Yayla, “Family complexity and cross-correlation measure for families of binary sequences,”
RAMANUJAN JOURNAL
, pp. 639–645, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/69844.