相关论文: Z2Z4-linear codes: generator matrices and duality

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…

A new generalization of the Gray map is introduced. The new generalization $\Phi: Z_{2^k}^n \to Z_{2}^{2^{k-1}n}$ is connected with the known generalized Gray map $\phi$ in the following way: if we take two dual linear $Z_{2^k}$-codes and…

If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of…

We study one generator quasi-cyclic codes and four-circulant codes, which are also quasi-cyclic but have two generators. We state the hull dimensions for both classes of codes in terms of the polynomials in their generating elements. We…

We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in…

We show that any binary $(n=2^m-3, 2^{n-m}, 3)$ code $C_1$ is a part of an equitable partition (perfect coloring) $\{C_1,C_2,C_3,C_4\}$ of the $n$-cube with the parameters $((0,1,n-1,0)(1,0,n-1,0)(1,1,n-4,2)(0,0,n-1,1))$. Now the…

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.…

In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring…

We give a complete classification of binary linear complementary dual codes of lengths up to $13$ and ternary linear complementary dual codes of lengths up to $10$.

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these…

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

Linear code with complementary dual($LCD$) are those codes which meet their duals trivially. In this paper we will give rather alternative proof of Massey's theorem\cite{Massey2}, which is one of the most important characterization of $LCD$…

In this paper, we study self-dual codes over $\mathbb{Z}_2 \times (\mathbb{Z}_2+u\mathbb{Z}_2) $, where $u^2=0$. Three types of self-dual codes are defined. For each type, the possible values $\alpha,\beta$ such that there exists a code…

We classify all $q$-ary $\Delta$-divisible linear codes which are spanned by codewords of weight $\Delta$. The basic building blocks are the simplex codes, and for $q=2$ additionally the first order Reed-Muller codes and the parity check…

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…

Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…

A cyclic codes of length $n$ over the rings $Z_{2^{m}}$ of integer of modulo $2^{m}$ is a linear code with property that if the codeword $(c_0,c_1,...,c_{n-1})\in \mathcal{C}$ then the cyclic shift $(c_1,c_2,...,c_0)\in \mathcal{C}$.…

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

Let C be a binary linear code and suppose that its automorphism group contains a non trivial subgroup G. What can we say about C knowing G? In this paper we collect some answers to this question in the cases G=C_p, G=C_2p and G=D_2p (p an…