4 citations · 5 across the 6 of their papers we have counts for
9 papers
Codes from incidence matrices of hypergraphs
Sudipta Mallik, Bahattin Yildiz
Binary codes are constructed from incidence matrices of hypergraphs. A combinatroial description is given for the minimum distances of such codes via a combinatorial tool called ``…
New Extremal Binary Self-Dual Codes from Block Circulant Matrices and Block Quadratic Residue Circulant Matrices
Joe Gildea, Abidin Kaya, Rhian Taylor +2
In this paper, we construct self-dual codes from a construction that involves both block circulant matrices and block quadratic residue circulant matrices. We provide conditions wh…
New Extremal binary self-dual codes of length 68 from a novel approach to neighbors
Joe Gildea, Abidin Kaya, Adrian Korban +1
In this work, we introduce the concept of distance between self-dual codes, which generalizes the concept of a neighbor for self-dual codes. Using the k-neighbors, we are able to c…
A group induced four-circulant construction for self-dual codes and new extremal binary self-dual codes
Joe Gildea, Abidin Kaya, Alexander Tylyshchak +1
We introduce an altered version of the four circulant construction over group rings for self-dual codes. We consider this construction over the binary field, the rings F_2 + uF_2 a…
New binary self-dual codes via a generalization of the four circulant construction
Joe Gildea, Abidin Kaya, Bahattin Yildiz
In this work, we generalize the four circulant construction for self-dual codes. By applying the constructions over the alphabets F_2, F_2 + uF_2, F_4+uF_4, we were able to obtain…
Isodual and Self-dual Codes from Graphs
Sudipta Mallik, Bahattin Yildiz
Binary linear codes are constructed from graphs, in particular, by the generator matrix where is the adjacency matrix of a graph on vertices. A combinatorial inte…