Related papers: Quasi-Cyclic Codes Over Finite Chain Rings
A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudo-random nature, and the new…
Due to the wide applications in consumer electronics, data storage systems and communication systems, cyclic codes have been an interesting research topic in coding theory. In this paper, let $p$ be a prime with $p\ge 7$. We determine the…
In this article, we introduce and study the concept of the exponent of a cyclic code over a finite field $\mathbb{F}_q.$ We give a relation between the exponent of a cyclic code and its dual code. Finally, we introduce and determine the…
We use recent results on matrix semi-invariants to give degree bounds on generators for the ring of semi-invariants for quivers with no oriented cycles.
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic…
In this paper skew constacyclic codes over finite non-chain ring R = F_q+uF_q+vF_q, where q= p^m, p is an odd prime and u^{2}=u, v^{2}=v, uv = vu = 0 are studied. We show that Gray image of a skew alpha-constacyclic cyclic code of length n…
Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s)$ and $\Gamma(\texttt{R})$ the Teichm\"uller's set of $\texttt{R}.$ In this paper, the trace representation cyclic $\texttt{R}$-linear codes of length $\ell,$ is…
This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the…
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…
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…
Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a…
In this paper, we investigate the algebraic structure for polycyclic codes over a specific class of serial rings, defined as $\mathscr R=R[x_1,\ldots, x_s]/\langle t_1(x_1),\ldots, t_s(x_s) \rangle$, where $R$ is a chain ring and each…
We study the structure of linear codes over the ring $B_k$ which is defined by $\mathbb{F}_{p^r}[v_1,v_2,\ldots,v_k]/\langle v_i^2=v_i,~v_iv_j=v_jv_i \rangle_{i,j=1}^k.$ In order to study the codes, we begin with studying the structure of…
In this paper we address the problem of translating one-way quantum computation (1WQC) into the circuit model. We start by giving a straightforward circuit representation of any 1WQC, at the cost of introducing many ancilla wires. We then…
In this note, we extend the quasi-projective dimension of finite (that is, finitely generated) modules to homologically finite complexes, and we investigate some of homological properties of this dimension.
Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further,…
Two-dimensional cyclic codes of length $n=\ell s$ over the finite field $\mathbb{F}$ are ideals of the polynomial ring $\frac{\mathbb{F}[x,y]}{< x^{s}-1,y^{\ell}-1 >}$. The aim of this paper, is to present a novel method to study the…
In network coding, a flag code is a set of sequences of nested subspaces of $\mathbb{F}_q^n$, being $\mathbb{F}_q$ the finite field with $q$ elements. Flag codes defined as orbits of a cyclic subgroup of the general linear group acting on…
In this paper we introduce the notion of $\lambda$-constacyclic codes over finite rings $R$ for arbitary element $\lambda$ of $R$. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal…