In this work, we focus on reversible cyclic codes which correspond toreversible DNA codes or reversible-complement DNA codes over a family of finite chain rings, in an effort to extend what was done by Yildiz and Siap in\cite{YildizSiap}. The ring fa...

Document(s)

Title

This is a pre-copy-editing, author-produced PDF of an article accepted for publication in Advances in Mathematics of Communications following peer review. The definitive publisher-authenticated version Dougherty, S., Gildea, J., Kaya, A., & Yildiz, B...

We introduce a bordered construction over group rings for self-dual codes. We apply the constructions over the binary field and the ring $\F_2+u\F_2$, using groups of orders 9, 15, 21, 25, 27, 33 and 35 to find extremal binary self-dual codes of leng...

We introduce a bordered construction over group rings for self-dual codes. We apply the constructions over the binary field and the ring $\F_2+u\F_2$, using groups of orders 9, 15, 21, 25, 27, 33 and 35 to find extremal binary self-dual codes of leng...

We introduce a bordered construction over group rings for self-dual codes. We apply the constructions over the binary field and the ring $\F_2+u\F_2$, using groups of orders 9, 15, 21, 25, 27, 33 and 35 to find extremal binary self-dual codes of leng...

In this work, we introduce new construction methods for self-dual codes using a Baumert-Hall array. We apply the constructions over the alphabets F_2 and F_4 + uF_4 and combine them with extension theorems and neighboring constructions. As a result, ...

In this work, we focus on reversible cyclic codes which correspond toreversible DNA codes or reversible-complement DNA codes over a family of finite chain rings, in an effort to extend what was done by Yildiz and Siap in\cite{YildizSiap}. The ring fa...

In this work, we focus on reversible cyclic codes which correspond toreversible DNA codes or reversible-complement DNA codes over a family of finite chain rings, in an effort to extend what was done by Yildiz and Siap in\cite{YildizSiap}. The ring fa...

In this work, construction methods for formally self-dual codes are generalized in the form of block lambda-circulant matrices. The constructions are applied over the rings F_2,R1 = F_2 + uF_2 and S = F_2[u]=(u^3-1). Using n-block lambda-circulant ma...