New Correlations of m-sequences over the finite field F4 compatible with a new bijection to Z4

2022-01-01
Boztas, Serdar
Özbudak, Ferruh
Tekin, Eda
© 2022 IEEE.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.
10th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2022

Suggestions

A generalized construction for perfect autocorrelation sequences
boztaş, serdar; kahraman, seda; Özbudak, Ferruh; TEKİN, EDA (2015-06-19)
In this paper we generalize a previous construction in order to design perfect autocorrelation sequences over the so-called PSK+ constellation defined by Boztas, and Udaya [2]. We give a number theoretic criterion for the existence of the new sequences with perfect autocorrelation, and discuss some preliminary numerical results on their aperiodic correlations and merit factors.
Correlation Distribution of a New Sequence Family
BOZTAŞ, Serdar; Özbudak, Ferruh; TEKİN, Eda (2015-06-19)
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).
New Efficient Algorithms for Multiplication Over Fields of Characteristic Three
Cenk, Murat; Hasan, M. Anwar (2018-03-01)
In this paper, we first present an enhancement of the well-known Karatsuba 2-way and 3-way algorithms for characteristic three fields, denoted by where nae1. We then derive a 3-way polynomial multiplication algorithm with five 1/3 sized multiplications that use interpolation in . Following the computation of the arithmetic and delay complexity of the proposed algorithm, we provide the results of our hardware implementation of polynomial multiplications over and . The final proposal is a new 3-way polynomial...
An algorithm for line matching in an image by mapping into an n-dimensional vector space
Sultanov, Raiymbek; Atakan, Ahmet; Ismailova, Rita (2019-01-01)
This paper proposes a minimal length difference algorithm for construction of a line in an image by solving the problem of optimal contour approximation. In this algorithm, a method for finding interest points is proposed, and the object matching (classification) is done by mapping interest points onto a vector space. In cases where the lines in the representation of the images are not smooth, the algorithm converges rapidly. The results of the experiments showed that for convergence of the contour simplifi...
On endomorphisms of surface mapping class groups
Korkmaz, Mustafa (Elsevier BV, 2001-05-01)
In this paper, we prove that every endomorphism of the mapping class group of an orientable surface onto a subgroup of finite index is in fact an automorphism.
Citation Formats
S. Boztas, F. Özbudak, and E. Tekin, “New Correlations of m-sequences over the finite field F4 compatible with a new bijection to Z4,” presented at the 10th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2022, Colchester , İngiltere, 2022, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85138747209&origin=inward.