Related papers: Reversible $G^k$-Codes with Applications to DNA Co…
Let $p$ be a prime number. In this paper, we discuss the structures of cyclic codes over the ring $ \mathbb{F}_p[u, v] / \langle u^k, v^2, uv-vu\rangle$. We find a unique set of generators for these codes. We also study the rank and the…
Let $q=p^h$ be a prime power and $e$ be an integer with $0\leq e\leq h-1$. $e$-Galois self-orthogonal codes are generalizations of Euclidean self-orthogonal codes ($e=0$) and Hermitian self-orthogonal codes ($e=\frac{h}{2}$ and $h$ is…
A primitive $k$-batch code encodes a string $x$ of length $n$ into string $y$ of length $N$, such that each multiset of $k$ symbols from $x$ has $k$ mutually disjoint recovering sets from $y$. We develop new explicit and random coding…
Motivated by applications in spatial genomics, we revisit group testing (Dorfman~1943) and propose the class of $\lambda$-{\sf ADD}-codes, studying such codes with certain distance $d$ and codelength $n$. When $d$ is constant, we provide…
We describe a new class of list decodable codes based on Galois extensions of function fields and present a list decoding algorithm. These codes are obtained as a result of folding the set of rational places of a function field using…
In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring $\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangle$ where $p$ is an odd prime and $m \geq 1$. In order to…
To equip DNA-based data storage with random-access capabilities, Yazdi et al. (2018) prepended DNA strands with specially chosen address sequences called primers and provided certain design criteria for these primers. We provide explicit…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
Quantum maximum-distance-separable (MDS) codes are an important class of quantum codes. In this paper, using constacyclic codes and Hermitain construction, we construct some new quantum MDS codes of the form $q=2am+t$,…
A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes…
One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order $q$ using weighing matrices…
A matrix $M$ over the finite field $ \mathbb{F}_q $ is called \emph{maximum distance separable} (MDS) if all of its square submatrices are non-singular. These MDS matrices are very important in cryptography and coding theory because they…
In computational molecular biology, gene regulatory binding sites prediction in whole genome remains a challenge for the researchers. Now a days, the genome wide regulatory binding site prediction tools required either direct pattern…
Composite DNA is a recent method to increase the base alphabet size in DNA-based data storage.This paper models synthesizing and sequencing of composite DNA and introduces coding techniques to correct substitutions, losses of entire…
Rank-metric codes are subspaces of matrices over finite fields endowed with the rank metric and admit a natural tensorial representation. The tensor rank provides a measure of the minimal size of a decomposition of a code into rank-one…
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…
In 2021, Augot, Couvreur, Lavauzelle and Neri introduced a new class of rank metric codes which can be regarded as rank metric counterparts of Reed-Muller codes. Given a finite Galois extension $\mathbb{L} / \mathbb{K}$, these codes are…
Linear codes with complementary duals (LCD) have a great deal of significance amongst linear codes. Maximum distance separable (MDS) codes are also an important class of linear codes since they achieve the greatest error correcting and…
To increase the information capacity of DNA storage, composite DNA letters were introduced. We propose a novel channel model for composite DNA in which composite sequences are decomposed into ordered standard non-composite sequences. The…