×
Author ID: kolotoglu.emre Recent zbMATH articles by "Kolotoğlu, Emre"
Published as: Kolotoğlu, Emre; Kolotoglu, Emre; Kolotoğlu, E.
External Links: MGP
Documents Indexed: 13 Publications since 2010
Co-Authors: 7 Co-Authors with 9 Joint Publications
192 Co-Co-Authors

Citations contained in zbMATH Open

11 Publications have been cited 51 times in 44 Documents Cited by Year
An application of constacyclic codes to entanglement-assisted quantum MDS codes. Zbl 1438.94069
Sarı, Mustafa; Kolotoğlu, Emre
21
2019
A complete solution to spectrum problem for five-vertex graphs with application to traffic grooming in optical networks. Zbl 1314.05114
Ge, Gennian; Hu, Sihuang; Kolotoğlu, Emre; Wei, Hengjia
8
2015
On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs. Zbl 1231.05023
Kolotoğlu, Emre; Yazıcı, Emine Şule
7
2010
The existence and construction of \((K_{5}\setminus e)\)-designs of orders 27, 135, 162, and 216. Zbl 1269.05019
Kolotoğlu, Emre
6
2013
On large sets of projective planes of orders 3 and 4. Zbl 1281.05022
Kolotoğlu, Emre; Magliveras, Spyros S.
2
2013
A different construction for some classes of quantum MDS codes. Zbl 1454.94130
Sarı, Mustafa; Kolotoğlu, Emre
2
2020
Related decompositions and new constructions of the Higman-Sims and Hall-Janko graphs. Zbl 1278.05198
Kolotoglu, Emre; Pace, Nicola; Magliveras, Spyros S.
1
2012
Decomposition of complete graphs into isomorphic complete bipartite graphs. Zbl 1286.05138
Kolotoğlu, Emre
1
2013
Quantum codes with improved minimum distance. Zbl 1418.81013
Kolotoğlu, Emre; Sari, Mustafa
1
2019
A complete solution to the spectrum problem for graphs with six vertices and up to nine edges. Zbl 1454.05020
Kolotoglu, Emre
1
2020
Optimal groomings with grooming ratios six and seven. Zbl 1350.05013
Ge, Gennian; Kolotoğlu, Emre; Wei, Hengjia
1
2015
A different construction for some classes of quantum MDS codes. Zbl 1454.94130
Sarı, Mustafa; Kolotoğlu, Emre
2
2020
A complete solution to the spectrum problem for graphs with six vertices and up to nine edges. Zbl 1454.05020
Kolotoglu, Emre
1
2020
An application of constacyclic codes to entanglement-assisted quantum MDS codes. Zbl 1438.94069
Sarı, Mustafa; Kolotoğlu, Emre
21
2019
Quantum codes with improved minimum distance. Zbl 1418.81013
Kolotoğlu, Emre; Sari, Mustafa
1
2019
A complete solution to spectrum problem for five-vertex graphs with application to traffic grooming in optical networks. Zbl 1314.05114
Ge, Gennian; Hu, Sihuang; Kolotoğlu, Emre; Wei, Hengjia
8
2015
Optimal groomings with grooming ratios six and seven. Zbl 1350.05013
Ge, Gennian; Kolotoğlu, Emre; Wei, Hengjia
1
2015
The existence and construction of \((K_{5}\setminus e)\)-designs of orders 27, 135, 162, and 216. Zbl 1269.05019
Kolotoğlu, Emre
6
2013
On large sets of projective planes of orders 3 and 4. Zbl 1281.05022
Kolotoğlu, Emre; Magliveras, Spyros S.
2
2013
Decomposition of complete graphs into isomorphic complete bipartite graphs. Zbl 1286.05138
Kolotoğlu, Emre
1
2013
Related decompositions and new constructions of the Higman-Sims and Hall-Janko graphs. Zbl 1278.05198
Kolotoglu, Emre; Pace, Nicola; Magliveras, Spyros S.
1
2012
On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs. Zbl 1231.05023
Kolotoğlu, Emre; Yazıcı, Emine Şule
7
2010

Citations by Year