Generalized nonbinary sequences with perfect autocorrelation, flexible alphabets and new periods

Date

2018-05-01

Author

BOZTAŞ, Serdar
Özbudak, Ferruh
TEKİN, Eda

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

230
views

0
downloads

We extend the parameters and generalize existing constructions of perfect autocorrelation sequences over complex alphabets. In particular, we address the PSK+ constellation (Boztas and Udaya 2010) and present an extended number theoretic criterion which is sufficient for the existence of the new sequences with perfect autocorrelation. These sequences are shown to exist for nonprime alphabets and more general lengths in comparison to existing designs. The new perfect autocorrelation sequences provide novel alternatives for wireless communications and radar system designers for applications in ranging and synchronisation as well as channel identification.

Subject Keywords

Computer Networks and Communications, Computational Theory and Mathematics, Applied Mathematics

URI

https://hdl.handle.net/11511/46974

Journal

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES

DOI

https://doi.org/10.1007/s12095-017-0237-6

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

On affine variety codes from the Klein quartic Geil, Olav; Özbudak, Ferruh (Springer Science and Business Media LLC, 2019-03-01) We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in Kolluru et al., (Appl. Algebra Engrg. Comm. Comput. 10(6):433-464, 2000, Ex. 3.2). Among the codes that we construct almost all have parameters as good as the best known codes according to Grassl (2007) and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound (Geil and HOholdt, IEEE Trans. Inform. The...
Strongly regular graphs arising from non-weakly regular bent functions Özbudak, Ferruh (Springer Science and Business Media LLC, 2019-11-01) In this paper, we study two special subsets of a finite field of odd characteristics associated with non-weakly regular bent functions. We show that those subsets associated to non-weakly regular even bent functions in the GMMF class (see cesmelioglu et al. Finite Fields Appl. 24, 105-117 2013) are never partial difference sets (PDSs), and are PDSs if and only if they are trivial subsets. Moreover, we analyze the two known sporadic examples of non-weakly regular ternary bent functions given in Helleseth and...
Joint linear complexity of multisequences consisting of linear recurring sequences Fu, Fang-Wei; Niederreiter, Harald; Özbudak, Ferruh (Springer Science and Business Media LLC, 2009-04-01) The linear complexity of sequences is one of the important security measures for stream cipher systems. Recently, in the study of vectorized stream cipher systems, the joint linear complexity of multisequences has been investigated. In this paper, we study the joint linear complexity of multisequences consisting of linear recurring sequences. The expectation and variance of the joint linear complexity of random multisequences consisting of linear recurring sequences are determined. These results extend the ...
Results on symmetric S-boxes constructed by concatenation of RSSBs KAVUT, SELÇUK; Baloglu, Sevdenur (Springer Science and Business Media LLC, 2019-07-01) In this paper, we first present an efficient exhaustive search algorithm to enumerate 6 x 6 bijective S-boxes with the best-known nonlinearity 24 in a class of S-boxes that are symmetric under the permutation (x) = (x(0), x(2), x(3), x(4), x(5), x(1)), where x = (x(0), x1,...,x5)?26. Since any S-box S:?26?26 in this class has the property that S((x)) = (S(x)) for every x, it can be considered as a construction obtained by the concatenation of 5 x 5 rotation-symmetric S-boxes (RSSBs). The size of the search ...
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...

Citation Formats

S. BOZTAŞ, F. Özbudak, and E. TEKİN, “Generalized nonbinary sequences with perfect autocorrelation, flexible alphabets and new periods,” CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, pp. 509–517, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46974.