Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Yayla, Oguz"'
Autor:
Cildiroglu, Hasan Ozgur, Yayla, Oguz
The advent of quantum computing has profound implications for current technologies, offering advancements in optimization while posing significant threats to cryptographic algorithms. Public-key cryptosystems relying on prime factorization or discret
Externí odkaz:
http://arxiv.org/abs/2412.10835
The Reed-Muller codes are a family of error-correcting codes that have been widely studied in coding theory. In 2020, Wei Yan and Sian-Jheng Lin introduced a variant of Reed-Muller codes so called symmetric Reed-Muller codes. We investigate linear ma
Externí odkaz:
http://arxiv.org/abs/2401.11496
Autor:
Şahin, Mesut, Yayla, Oğuz
We obtain certain algebraic invariants relevant to study codes on subgroups of weighted projective tori inside an $n$-dimensional weighted projective space. As application, we compute all the main parameters of generalized toric codes on these subgro
Externí odkaz:
http://arxiv.org/abs/2210.07550
Autor:
Özden, Büşra, Yayla, Oğuz
In this paper, we study the sequences with (non-consecutive) two zero-symbols and ideal autocorrelation, which are also known as almost $m$-ary nearly perfect sequences. We show that these sequences are equivalent to $\ell$-partial direct product dif
Externí odkaz:
http://arxiv.org/abs/2005.12497
We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational points of alge
Externí odkaz:
http://arxiv.org/abs/2005.09402
In this short paper, we study the capacity-constrained vehicle routing problem (CVRP) and its solution by randomized Monte Carlo methods. For solving CVRP we use some pseudorandom number generators commonly used in practice. We use linear, multiple-r
Externí odkaz:
http://arxiv.org/abs/2005.05871
In this paper we study pseudorandomness of a family of sequences in terms of two measures, the family complexity ($f$-complexity) and the cross-correlation measure of order $\ell$. We consider sequences not only on binary alphabet but also on $k$-sym
Externí odkaz:
http://arxiv.org/abs/2004.13938
A Butson-Hadamard matrix H is a square matrix of dimension n whose entries are complex roots of unity such that HH*= nI. In the first part of this work, some new results on generalized Gray map are studied. In the second part, codes obtained from But
Externí odkaz:
http://arxiv.org/abs/2004.00771
Autor:
Çakıroǧlu, Yaǧmur, Yayla, Oǧuz
In this paper we study a family of binary Legendre sequences and its family complexity. Family complexity is a pseudorandomness measure introduced by Ahlswede et.~al.~in 2003. A lower bound on the family complexity of a family based on the Legendre s
Externí odkaz:
http://arxiv.org/abs/1812.06140
Autor:
Özden, Büşra, Yayla, Oğuz
In this paper we study almost $p$-ary sequences and their autocorrelation coefficients. We first study the number $\ell$ of distinct out-of-phase autocorrelation coefficients for an almost $p$-ary sequence of period $n+s$ with $s$ consecutive zero-sy
Externí odkaz:
http://arxiv.org/abs/1807.11412