Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Bibak, Khodakhast"'
In recent years, the existence of a significant cross-impact between Cloud computing and Internet of Things (IoT) has lead to a dichotomy that gives raise to Cloud-Assisted IoT (CAIoT) and IoT-Based Cloud (IoTBC). Although it is pertinent to study bo
Externí odkaz:
http://arxiv.org/abs/2207.01590
Publikováno v:
Information Processing Letters 116 (2016), 481-483
Universal hash functions, discovered by Carter and Wegman in 1979, are of great importance in computer science with many applications. MMH$^*$ is a well-known $\triangle$-universal hash function family, based on the evaluation of a dot product modulo
Externí odkaz:
http://arxiv.org/abs/2010.05420
Publikováno v:
Designs, Codes and Cryptography 86 (2018), 1893-1904
In this paper, we first give explicit formulas for the number of solutions of unweighted linear congruences with distinct coordinates. Our main tools are properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions. Then
Externí odkaz:
http://arxiv.org/abs/2010.05415
Publikováno v:
IEEE Transactions on Information Theory 62 (2016), 6355-6358
Let $\Z_n[i]$ be the ring of Gaussian integers modulo a positive integer $n$. Very recently, Camarero and Mart\'{i}nez [IEEE Trans. Inform. Theory, {\bf 62} (2016), 1183--1192], showed that for every prime number $p>5$ such that $p\equiv \pm 5 \pmod{
Externí odkaz:
http://arxiv.org/abs/2010.05407
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bibak, Khodakhast
In this dissertation, I introduce some number theoretic methods and discuss their intriguing applications to a variety of problems in computer science, information theory, combinatorics, and geometry. First, using properties of Ramanujan sums and of
Externí odkaz:
http://hdl.handle.net/1828/7911
Autor:
Bibak, Khodakhast, Milenkovic, Olgica
We introduce a general class of codes which includes several well-known classes of deletion/insertion correcting codes as special cases. For example, the Helberg code, the Levenshtein code, the Varshamov--Tenengolts code, and most variants of these c
Externí odkaz:
http://arxiv.org/abs/1812.09627
Publikováno v:
In Journal of Information Security and Applications March 2023 73
Publikováno v:
Discrete Mathematics 342 (2019), 3057-3061
Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pm
Externí odkaz:
http://arxiv.org/abs/1712.06770