Cem Güneri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Cem Güneri has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Ferruh Özbudak
FENS, Sabancı University, Istanbul, Turkey
12 shared publications - Patrick Solé
I2M (CNRS, University of Aix-Marseille), Marseilles, France
9 shared publications - Adel Alahmadi
Research Group of Algebraic Structures and Applications, Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah, Saudi Arabia
5 shared publications - Hatoon Shoaib
Research Group of Algebraic Structures and Applications, Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia
5 shared publications - Buket Özkaya
Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey
4 shared publications - Selcen Sayıcı
Faculty of Engineering and Natural Sciences, Sabancı University, Istanbul, Turkey
3 shared publications
Latest Publications
- 25 March 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 24 (13n14)
On the hull and complementarity of 1-generator quasi-cyclic codes and four-circulant codes
We study 1-generator quasi-cyclic codes and four-circulant codes, which are also quasi-cyclic but have 2 generators. We state the hull dimensions for both classes of codes in terms of the polynomials in their generating elements. We prove results such as the hull dimension of a four-circulant code is even and one-dimensional hull for double-circulant codes, which are special 1-generator codes, is not possible when the alphabet size [ ] is congruent to 3 mod 4. We also characterize linear complementary pairs among both classes of codes. Computational results on the code families in consideration are provided as well.
- 25 March 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 24 (13n14)
On the hull and complementarity of 1-generator quasi-cyclic codes and four-circulant codes
We study 1-generator quasi-cyclic codes and four-circulant codes, which are also quasi-cyclic but have 2 generators. We state the hull dimensions for both classes of codes in terms of the polynomials in their generating elements. We prove results such as the hull dimension of a four-circulant code is even and one-dimensional hull for double-circulant codes, which are special 1-generator codes, is not possible when the alphabet size [ ] is congruent to 3 mod 4. We also characterize linear complementary pairs among both classes of codes. Computational results on the code families in consideration are provided as well.
- 5 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (11) , 7840-7847
Griesmer Bound and Constructions of Linear Codes in b-Symbol Metric
The b-symbol metric is a generalization of the Hamming metric. Linear codes in the b-symbol metric have been used in the read channel whose outputs consist of b consecutive symbols. The Griesmer bound outperforms the Singleton bound for ${\mathbb {F}}_{q}$ -linear codes in the Hamming metric, when q is fixed and the length is large enough. This scenario is also applicable in the b-symbol metric. Shi, Zhu, and Helleseth recently made a conjecture on cyclic codes in the b-symbol metric. In this paper, we present the b-symbol Griesmer bound for linear codes by concatenating linear codes and simplex codes. Based on cyclic codes and extended cyclic codes, we propose two families of distance-optimal linear codes with respect to the b-symbol Griesmer bound.
- 5 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (11) , 7840-7847
Griesmer Bound and Constructions of Linear Codes in b-Symbol Metric
The b-symbol metric is a generalization of the Hamming metric. Linear codes in the b-symbol metric have been used in the read channel whose outputs consist of b consecutive symbols. The Griesmer bound outperforms the Singleton bound for ${\mathbb {F}}_{q}$ -linear codes in the Hamming metric, when q is fixed and the length is large enough. This scenario is also applicable in the b-symbol metric. Shi, Zhu, and Helleseth recently made a conjecture on cyclic codes in the b-symbol metric. In this paper, we present the b-symbol Griesmer bound for linear codes by concatenating linear codes and simplex codes. Based on cyclic codes and extended cyclic codes, we propose two families of distance-optimal linear codes with respect to the b-symbol Griesmer bound.
- 23 June 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (3) , 667-680
On subfield subcodes obtained from restricted evaluation codes
- 23 June 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (3) , 667-680
On subfield subcodes obtained from restricted evaluation codes
- 20 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (10) , 6512-6517
Optimal Binary Linear Complementary Pairs From Solomon-Stiffler Codes
Carlet et al. showed that for q ≥ 3, there exists a linear complementary pair of codes over F q whose security parameter is as good as the minimum distance dL of the best linear code with the same length and dimension. For binary codes, they proved that the security parameter of a linear complementary pair of codes is lower bounded by dL – 1. Choi et al. recently presented infinite families of binary linear complementary pairs which are optimal in the sense that their security parameters reach dL . Here, we prove that for every k ≥ 5 and d ≥ ⌈( k – 1)/2⌉2 k–1 , there exist binary linear complementary pairs of codes of length g(k, d) , where g(k, d) denotes the Griesmer bound. This shows the existence of an infinite family of optimal binary LCP of codes for new code parameters, which extensively broaden those obtained by Choi et al. Our construction is explicit and it is based on codes reaching the Griesmer bound, which were constructed by Solomon and Stiffler.
- 20 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (10) , 6512-6517
Optimal Binary Linear Complementary Pairs From Solomon-Stiffler Codes
Carlet et al. showed that for q ≥ 3, there exists a linear complementary pair of codes over F q whose security parameter is as good as the minimum distance dL of the best linear code with the same length and dimension. For binary codes, they proved that the security parameter of a linear complementary pair of codes is lower bounded by dL – 1. Choi et al. recently presented infinite families of binary linear complementary pairs which are optimal in the sense that their security parameters reach dL . Here, we prove that for every k ≥ 5 and d ≥ ⌈( k – 1)/2⌉2 k–1 , there exist binary linear complementary pairs of codes of length g(k, d) , where g(k, d) denotes the Griesmer bound. This shows the existence of an infinite family of optimal binary LCP of codes for new code parameters, which extensively broaden those obtained by Choi et al. Our construction is explicit and it is based on codes reaching the Griesmer bound, which were constructed by Solomon and Stiffler.
- 2 November 2022
- Published by Springer Nature in Cryptography and Communications
- Vol. 15 (2) , 469-486
Optimal Binary Linear Complementary Pairs of Codes
- 2 November 2022
- Published by Springer Nature in Cryptography and Communications
- Vol. 15 (2) , 469-486
Optimal Binary Linear Complementary Pairs of Codes
- 15 September 2021
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 90 (11) , 2647-2661
The concatenated structure of quasi-abelian codes
- 15 September 2021
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 90 (11) , 2647-2661
The concatenated structure of quasi-abelian codes
- 29 August 2020
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 88 (11) , 2397-2405
Linear complementary pair of group codes over finite chain rings
- 29 August 2020
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 88 (11) , 2397-2405
Linear complementary pair of group codes over finite chain rings
- Open Access
Linear Complementary Pair Of Group Codes over Finite Chain Rings
Linear complementary dual (LCD) codes and linear complementary pair (LCP) of codes over finite fields have been intensively studied recently due to their applications in cryptography, in the context of side-channel and fault injection attacks. The security parameter for an LCP of codes $(C,D)$ is defined as the minimum of the minimum distances $d(C)$ and $d(D^\bot)$. It has been recently shown that if $C$ and $D$ are both 2-sided group codes over a finite field, then $C$ and $D^\bot$ are permutation equivalent. Hence the security parameter for an LCP of 2-sided group codes $(C,D)$ is simply $d(C)$. We extend this result to 2-sided group codes over finite chain rings.Open AccessLinear Complementary Pair Of Group Codes over Finite Chain Rings
Linear complementary dual (LCD) codes and linear complementary pair (LCP) of codes over finite fields have been intensively studied recently due to their applications in cryptography, in the context of side-channel and fault injection attacks. The security parameter for an LCP of codes $(C,D)$ is defined as the minimum of the minimum distances $d(C)$ and $d(D^\bot)$. It has been recently shown that if $C$ and $D$ are both 2-sided group codes over a finite field, then $C$ and $D^\bot$ are permutation equivalent. Hence the security parameter for an LCP of 2-sided group codes $(C,D)$ is simply $d(C)$. We extend this result to 2-sided group codes over finite chain rings. - 21 June 2019
- Published by Springer Nature in Cryptography and Communications
- Vol. 12 (1) , 101-113
On complementary dual multinegacirculant codes
- 21 June 2019
- Published by Springer Nature in Cryptography and Communications
- Vol. 12 (1) , 101-113
On complementary dual multinegacirculant codes
- Open Access
The Concatenated Structure of Quasi-Abelian Codes
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a concatenated decomposition of quasi-abelian codes and show, as in the quasi-cyclic case, that the two decompositions are equivalent. The concatenated decomposition allows us to give a general minimum distance bound for quasi-abelian codes and to construct some optimal codes. Moreover, we show by examples that the minimum distance bound is sharp in some cases. In addition, examples of large strictly quasi-abelian codes of about a half rate are given. The concatenated structure also enables us to conclude that strictly quasi-abelian linear complementary dual codes over any finite field are asymptotically good.
Open AccessThe Concatenated Structure of Quasi-Abelian Codes
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a concatenated decomposition of quasi-abelian codes and show, as in the quasi-cyclic case, that the two decompositions are equivalent. The concatenated decomposition allows us to give a general minimum distance bound for quasi-abelian codes and to construct some optimal codes. Moreover, we show by examples that the minimum distance bound is sharp in some cases. In addition, examples of large strictly quasi-abelian codes of about a half rate are given. The concatenated structure also enables us to conclude that strictly quasi-abelian linear complementary dual codes over any finite field are asymptotically good.