Correlation Distribution of a New Sequence Family

2015-06-19
BOZTAŞ, Serdar
Özbudak, Ferruh
TEKİN, Eda
In this paper a new binary sequence family with 2(n) + 1 cyclically distinct sequences each having length 2(n) - 1 is presented for an even integer n. The correlation distribution of the family is fully determined. The family has six-valued correlation distribution and its maximum correlation magnitude equals 1 + 2(n/2 + 1).

Suggestions

New Correlations of m-sequences over the finite field F4 compatible with a new bijection to Z4
Boztas, Serdar; Özbudak, Ferruh; Tekin, Eda (2022-01-01)
In this paper we obtain a new method to compute the correlation values of two arbitrary sequences defined by a mapping from F4n to F4. We apply this method to demon-strate that the usual nonbinary maximal length sequences have almost ideal correlation under the canonical complex correlation definition and investigate some decimations giving good cross correlation.
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)}.
Sequence families with good correlation distribution
Tekin, Eda; Özbudak, Ferruh; Department of Cryptography (2016)
In this thesis we focus on two main properties of sequences which have wide range of applications in code division multiple access: autocorrelation and cross-correlation. First, necessary properties of sequences, some known perfect autocorrelation sequences and some known sequence families with their cross-correlation properties are given. Then, a perfect autocorrelation sequence [18] is generalized with respect to a number theoretic constraint of n for a given prime power q. This generalization enables the...
Efficient interleaved Montgomery modular multiplication for lattice-based cryptography
AKLEYLEK, SEDAT; Tok, Zaliha Yuce (2014-01-01)
In this paper, we give modified version of interleaved Montgomery modular multiplication method for lattice-based cryptography. With the proposed algorithms, we improve the multiplication complexity and embed the conversion operation into the algorithm with almost free cost. We implement the proposed methods for the quotient ring (Z/qZ)[x]/(x(n) - 1) and (Z/pZ)[x]/(x(n) + 1) on the GPU (NVIDIA Quadro 600) using the CUDA platform. NTRUEncrypt is accelerated approximately 35% on the GPU by using the proposed ...
Approximate factorization using ACDI method on hybrid grids and parallelization of the scheme
Onay, Oğuz Kaan; Kurtuluş, Dilek Funda; Sezer Uzol, Nilay; Department of Aerospace Engineering (2013)
In this thesis study, a fast implicit iteration scheme called Alternating Cell Directions Imp licit method is combined with Approximate Factorization scheme. This application aims to offer a mathematically well defined version of the Alternating Cell Directions Implicit Method and increase the accuracy of the iteration scheme that is being used for the numerical solutions of the partial differential equations. The iteration scheme presented here is tested using unsteady diffusion equation, Laplace equation ...
Citation Formats
S. BOZTAŞ, F. Özbudak, and E. TEKİN, “Correlation Distribution of a New Sequence Family,” 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35432.