English
Related papers

Related papers: Self-Dual Codes over Z_2xZ_4

200 papers

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 construct extremal binary self-dual codes of length 68 with…

Combinatorics · Mathematics 2020-02-25 Joe Gildea , Abidin Kaya , Adrian Korban , Bahattin Yildiz

Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…

Information Theory · Computer Science 2007-11-27 Ted Hurley

Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…

Information Theory · Computer Science 2017-09-25 Minjia Shi , Hongwei Zhu , Patrick Sole

New $s$-extremal extremal unimodular lattices in dimensions $38$, $40$, $42$ and $44$ are constructed from self-dual codes over $\mathbb{F}_5$ by Construction A. In the process of constructing these codes, we obtain a self-dual $[44,22,14]$…

Information Theory · Computer Science 2022-08-09 Masaaki Harada

In this paper we characterize the algebraic structure of two-dimensional $(\alpha,\beta )$-constacyclic codes of arbitrary length $s.\ell$ and of their duals. For $\alpha,\beta \in \{1,-1\}$, we give necessary and sufficient conditions for…

Information Theory · Computer Science 2020-07-30 Swati Bhardwaj , Madhu Raka

We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…

Information Theory · Computer Science 2022-12-16 Heide Gluesing-Luerssen , Alberto Ravagnani

The Nordstrom-Robinson, Kerdock, and (slightly modified) Pre\- parata codes are shown to be linear over $\ZZ_4$, the integers $\bmod~4$. The Kerdock and Preparata codes are duals over $\ZZ_4$, and the Nordstrom-Robinson code is self-dual.…

Combinatorics · Mathematics 2009-09-25 A. R. Calderbank , A. Roger Hammons , P. Vijay Kumar , N. J. A. Sloane , Patrick Solé

A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…

Combinatorics · Mathematics 2014-11-25 Martino Borello , Gabriele Nebe

Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…

Cryptography and Security · Computer Science 2020-03-31 Minjia Shi , Li Xu , Patrick Sole

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…

Combinatorics · Mathematics 2019-02-06 Abidin Kaya , Bahattin Yildiz

In this paper, we study one-Lee weight and two-Lee weight codes over $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$, where $u^{2}=0$. Some properties of one-Lee weight $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-additive codes are given, and a complete…

Rings and Algebras · Mathematics 2018-02-05 Zhenliang Lu , Liqi Wang , Shixin Zhu , Xiaoshan Kai

We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.

Information Theory · Computer Science 2016-01-12 MinJia Shi , Yan Liu , Patrick Solé

We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…

Information Theory · Computer Science 2021-02-22 Whan-Hyuk Choi , Jon-Lark Kim

In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…

Information Theory · Computer Science 2022-05-03 Minjia Shi , Haodong Lu , Shuang Zhou , Jiarui Xu , Yuhang Zhu

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, 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 paper, two different Gray-like maps from $Z_p^\alpha\times Z_{p^k}^\beta$, where $p$ is prime, to $Z_p^n$, $n={\alpha+\beta p^{k-1}}$, denoted by $\phi$ and $\Phi$, respectively, are presented. We have determined the connection…

Information Theory · Computer Science 2020-02-18 Minjia Shi , Rongsheng Wu , Denis S. Krotov

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

In this note, we establish a mass formula for self-orthogonal codes over Z_{p^2}, where p is a prime. As a consequence, an alternative proof of the known mass formulas for self-dual codes over Z_{p^2} is obtained. We also establish a mass…

Combinatorics · Mathematics 2010-06-15 Rowena A. L. Betty , Akihiro Munemasa

An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given.

Combinatorics · Mathematics 2012-10-10 Stefka Bouyuklieva , Iliya Bouyukliev