Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Olmez, Oktay"'
The study of regular incidence structures such as projective planes and symmetric block designs is a well established topic in discrete mathematics. Work of Bruck, Ryser and Chowla in the mid-twentieth century applied the Hasse-Minkowski local-global
Externí odkaz:
http://arxiv.org/abs/2308.06008
In this paper, we give upper and lower bounds for the spectral norms of r-circulant matrices with the generalized bi-periodic Fibonacci numbers. Moreover, we investigate the eigenvalues and determinants of these matrices.
Externí odkaz:
http://arxiv.org/abs/2101.12557
Publikováno v:
In Linear Algebra and Its Applications 1 February 2024 682:1-27
Autor:
Çeşmelioğlu, Ayça, Olmez, Oktay
A function $F:\mathbb{F}_{p^n}\rightarrow \mathbb{F}_{p^m},$ is a vectorial $s$-plateaued function if for each component function $F_{b}(\mu)=Tr_n(\alpha F(x)), b\in \mathbb{F}_{p^m}^*$ and $\mu \in \mathbb{F}_{p^n}$, the Walsh transform value $|\wid
Externí odkaz:
http://arxiv.org/abs/1807.11181
Autor:
Grezet, Matthias, Freij-Hollanti, Ragnar, Westerbäck, Thomas, Olmez, Oktay, Hollanti, Camilla
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers, which makes
Externí odkaz:
http://arxiv.org/abs/1709.05801
In this paper, we show how certain three-class association schemes and orthogonal arrays give rise to partial geometric designs. We also investigate the connections between partial geometric designs and certain regular graphs having three or four dis
Externí odkaz:
http://arxiv.org/abs/1501.01684
Autor:
Olmez, Oktay, Ramamoorthy, Aditya
Fractional repetition (FR) codes are a class of regenerating codes for distributed storage systems with an exact (table-based) repair process that is also uncoded, i.e., upon failure, a node is regenerated by simply downloading packets from the survi
Externí odkaz:
http://arxiv.org/abs/1408.5780
The concept of directed strongly regular graphs was introduced by Duval in his paper, A Directed Graph Version of Strongly Regular Graphs. Duval also provided several construction methods for directed strongly regular graphs. The directed strongly re
Externí odkaz:
http://arxiv.org/abs/1311.0494
Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyclotomy. We show that in each of these fields neither the multiplicativ
Externí odkaz:
http://arxiv.org/abs/1310.1164
Autor:
Olmez, Oktay, Ramamoorthy, Aditya
We consider the design of regenerating codes for distributed storage systems that enjoy the property of local, exact and uncoded repair, i.e., (a) upon failure, a node can be regenerated by simply downloading packets from the surviving nodes and (b)
Externí odkaz:
http://arxiv.org/abs/1305.5764