Zobrazeno 1 - 10
of 153
pro vyhledávání: '"Irfan Siap"'
Autor:
Fatih Temiz, Irfan Siap
Publikováno v:
Journal of Symbolic Computation. 120:102227
Publikováno v:
Arabian Journal of Mathematics, Vol 6, Iss 4, Pp 297-308 (2017)
Externí odkaz:
https://doaj.org/article/4e9148210b324443b5a83c4750925d27
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 15
In this paper, we will study the structure of [Formula: see text]-additive codes where [Formula: see text] is the well-known ring of 4 elements and [Formula: see text] is the ring given by [Formula: see text], where [Formula: see text], [Formula: see
Publikováno v:
Finite Fields and Their Applications. 48:241-260
Recently some special type of mixed alphabet codes that generalize the standard codes has attracted much attention. Besides Z 2 Z 4 -additive codes, Z 2 Z 2 [ u ] -linear codes are introduced as a new member of such families. In this paper, we are in
Publikováno v:
IEEE Transactions on Information Theory. 63:4883-4893
Following the very recent studies on $\mathbb {Z}_{2}\mathbb {Z}_{4}$ -additive codes, $\mathbb {Z}_{2}\mathbb {Z}_{2}[u]$ -linear codes have been introduced by Aydogdu et al. In this paper, we introduce and study the algebraic structure of cyclic, c
Publikováno v:
Finite Fields and Their Applications. 46:217-234
In this work we introduce a novel approach to find reversible codes over different alphabets, using so-called coterm polynomials and a module-construction. We obtain many optimal reversible codes with these constructions. In an attempt to apply the c
Autor:
Irfan Siap, E Mehmet Koroglu
Publikováno v:
Filomat. 31:2917-2923
Constacyclic codes are preferred in engineering applications due to their efficient encoding process via shift registers. The class of constacyclic codes contains cyclic and negacyclic codes. The relation and presentation of cyclic codes as group alg
Autor:
Ibrahim Ozbek, Irfan Siap
Publikováno v:
Electronic Notes in Discrete Mathematics. 56:43-48
Secret sharing schemes (SSS) offer efficient methods in protecting a secret data shared in parts by shareholders against unauthorized people. Furthermore, this sharing is formed in a way that only a predesigned minimum number of shareholders can solv
Autor:
Irfan Siap, Mustafa Sari
Publikováno v:
Bulletin of the Korean Mathematical Society. 53:1617-1628
Publikováno v:
Journal of Algebra Combinatorics Discrete Structures and Applications, Vol 6, Iss 3 (2019)
Secret sharing scheme is an efficient method to hide secret key or secret image by partitioning it into parts such that some predetermined subsets of partitions can recover the secret but remaining subsets cannot. In 1979, the pioneer construction on