Related papers: $\mathbb{F}_{2}\mathbb{F}_{4}$-Additive Complement…
In this paper, we study the codes over the matrix ring over $\mathbb{Z}_4$, which is perhaps the first time the ring structure $M_2(\mathbb{Z}_4)$ is considered as a code alphabet. This ring is isomorphic to…
Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based…
The BCD (Binary Coded Decimal) being the more accurate and human-readable representation with ease of conversion, is prevailing in the computing and electronic communication.In this paper, a tree-structured parallel BCD addition algorithm…
We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is…
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…
In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance preserving…
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.…
Given a finite group $G$ and an extension of finite chain rings $S|R$, one can consider the group rings $\mathscr{S} = S[G]$ and $\mathscr{R} = R[G]$. The group ring $\mathscr{S}$ can be viewed as an $R$-bimodule, and any of its…
We give a polynomial representation for additive cyclic codes over $\mathbb{F}_{p^2}$. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator…
Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…
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…
The main aim of this paper is to study $LCD$ codes. Linear code with complementary dual($LCD$) are those codes which have their intersection with their dual code as $\{0\}$. In this paper we will give rather alternative proof of Massey's…
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]$…
Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…
Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes…
For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…
A Z2Z4-additive code C is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z_2 and the set of Z_4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant.…
This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction.…
In this paper, we introduce a standard generator matrix for mixed-alphabet linear codes over finite chain rings. Furthermore, we show that, when one has a linear complementary pair (LCP) of mixed-alphabet linear codes, both codes are…
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and…