English
Related papers

Related papers: New binary self-dual codes of lengths 56, 62, 78, …

200 papers

In this work, we define a modification of a bordered construction for self-dual codes which utilises $\lambda$-circulant matrices. We provide the necessary conditions for the construction to produce self-dual codes over finite commutative…

Information Theory · Computer Science 2023-01-18 Joe Gildea , Adrian Korban , Adam Michael Roberts , Alexander Tylyshchak

In this work, we give a new technique for constructing self-dual codes over commutative Frobenius rings using $\lambda$-circulant matrices. The new construction was derived as a modification of the well-known four circulant construction of…

Combinatorics · Mathematics 2021-06-24 Joe Gildea , Adrian Korban , Adam Michael Roberts

In this work, we propose a modified four circulant construction for self-dual codes and a bordered version of the construction using the properties of \lambda-circulant and \lambda-reverse circulant matrices. By using the constructions on…

Information Theory · Computer Science 2016-02-24 Abidin Kaya , Bahattin Yildiz , Abdullah Paşa

In this work, we apply the idea of composite matrices arising from group rings to derive a number of different techniques for constructing self-dual codes over finite commutative Frobenius rings. By applying these techniques over different…

Combinatorics · Mathematics 2023-01-18 Joe Gildea , Adrian Korban , Adam Michael Roberts

In this work, we give three new techniques for constructing Hermitian self-dual codes over commutative Frobenius rings with a non-trivial involutory automorphism using $\lambda$-circulant matrices. The new constructions are derived as…

Combinatorics · Mathematics 2023-01-18 Adam Michael Roberts

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 when this construction can yield self-dual codes. We construct…

Rings and Algebras · Mathematics 2020-04-02 Joe Gildea , Abidin Kaya , Rhian Taylor , Alexander Tylyshchak , 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 extremal binary self-dual codes of lengths 40, 64 including…

Combinatorics · Mathematics 2019-12-30 Joe Gildea , Abidin Kaya , Bahattin Yildiz

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 and F_4 + uF_4; using groups of order 3, 7, 9, 13, and 15.…

Combinatorics · Mathematics 2019-12-30 Joe Gildea , Abidin Kaya , Alexander Tylyshchak , Bahattin Yildiz

In this work, quadratic double and quadratic bordered double circulant constructions are applied to F_4 + uF_4 as well as F_4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension…

Combinatorics · Mathematics 2016-02-25 Abidin Kaya , Bahattin Yildiz , Irfan Siap

In this paper, we construct self-dual codes from a construction that involves 2x2 block circulant matrices, group rings and a reverse circulant matrix. We provide conditions whereby this construction can yield self-dual codes. We construct…

Rings and Algebras · Mathematics 2020-02-25 Joe Gildea , Abidin Kaya , Rhian Taylor , Alexander Tylyshchak

In this work, quadratic reside codes over the ring F2 +uF2 +u^2F2 with u^3 = u are considered. A duality and distance preserving Gray map from F2 + uF2 + u^2F2 to (F_2)^3 is defined. By using quadratic double circulant, quadratic bordered…

Information Theory · Computer Science 2016-02-25 Abidin Kaya , Bahattin Yildiz , Irfan Siap

In this work, four circulant and quadratic double circulant (QDC) constructions are applied to the family of the rings R_k,m. Self-dual binary codes are obtained as the Gray images of self-dual QDC codes over R_k,m. Extremal binary…

Information Theory · Computer Science 2016-10-31 Abidin Kaya , Nesibe Tüfekçi

Many generator matrices for constructing extremal binary self-dual codes of different lengths have the form G=(I|A), where I is the n by n identity matrix and A is the n by n matrix fully determined by the first row. In this work, we define…

Information Theory · Computer Science 2020-03-12 Maria Bortos , Joe Gildea , Abidin Kaya , Adrian Korban , Alexander Tylyshchak

In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F_2 +…

Combinatorics · Mathematics 2016-02-24 Abidin Kaya

We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of [9]. In particular, we improve the previous results by…

Number Theory · Mathematics 2017-06-26 Pınar Çomak , Jon-Lark Kim , Ferruh Özbudak

In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring…

Information Theory · Computer Science 2020-02-27 Steven T. Dougherty , Joe Gildea , Adrian Korban , Abidin Kaya

In this work, we study codes generated by elements that come from group matrix rings. We present a matrix construction which we use to generate codes in two different ambient spaces: the matrix ring $M_k(R)$ and the ring $R,$ where $R$ is…

Information Theory · Computer Science 2021-02-02 Steven Dougherty , Adrian Korban , Serap Sahinkaya , Deniz Ustun

We give constructions of self-dual and formally self-dual codes from group rings where the ring is a finite commutative Frobenius ring. We improve the existing construction given in \cite{Hurley1} by showing that one of the conditions given…

Information Theory · Computer Science 2016-04-28 Steven T. Dougherty , Joe Gildea , Rhian Taylor , Alexander Tylyshchak

In this work, we study codes over the ring R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius, characteristic 2 extensions of the binary field. We introduce a distance and duality preserving Gray map from R_{k,m} to…

Information Theory · Computer Science 2014-06-06 Nesibe Tufekci , Bahattin Yildiz

In this work, we define three composite matrices derived from group rings. We employ these composite matrices to create generator matrices of the form [In | {\Omega}(v)], where In is the identity matrix and {\Omega}(v) is a composite matrix…

Information Theory · Computer Science 2021-02-02 Adrian Korban , Serap Sahinkaya , Deniz Ustun
‹ Prev 1 2 3 10 Next ›