Related papers: An Efficient Construction of Self-Dual Codes
This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic $p^2$ and order $p^4$ with $p$ and odd prime. When $p \equiv 3 \pmod{4},$ we give…
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…
We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any…
In this paper we construct new optimal hierarchical locally recoverable codes. Our construction is based on a combination of the ideas of \cite{ballentine2019codes,sasidharan2015codes} with an algebraic number theoretical approach that…
Self-dual codes over F5 exist for all even lengths. The smallest length for which the largest minimum weight among self-dual codes has not been determined is 24, and the largest minimum weight is either 9 or 10. In this note, we show that…
This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal…
We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n,k. Among these new codes there is an optimal ternary…
We improve Levenshtein's upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we construct…
In this article, we present two new approaches to construct minimal linear codes of dimension $n+1$ over $\mathbb{F}_{3}$ using characteristic and ternary functions. We also obtain the weight distributions of these constructed minimal…
We contribute to the knowledge of linear codes from special polynomials and functions, which have been studied intensively in the past few years. Such codes have several applications in secret sharing, authentication codes, association…
Combinatorial designs are closely related to linear codes. In recent year, there are a lot of $t$-designs constructed from certain linear codes. In this paper, we aim to construct $2$-designs from binary three-weight codes. For any binary…
We define a class of automorphisms of rational function fields of finite characteristic and employ these to construct different types of optimal linear rank-metric codes. The first construction is of generalized Gabidulin codes over…
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…
We construct two new infinite families of trace codes of dimension $2m$, over the ring $\mathbb{F}_p+u\mathbb{F}_p,$ when $p$ is an odd prime. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by…
We investigate additive codes, defined as $\mathbb{F}_q$-linear subspaces $C \subseteq \mathbb{F}_{q^h}^n$ of length $n$ and dimension $r$ over $\mathbb{F}_q$. An additive code is said to be of type $[n, r/h, d]_q^h$, where $d$ denotes the…
We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of [9]. In particular, we improve the previous results by…
New series of $2^{2m}$-dimensional universally strongly perfect lattices $\Lambda_I $ and $\Gamma_J $ are constructed with $$2BW_{2m} ^{\#} \subseteq \Gamma _J \subseteq BW_{2m} \subseteq \Lambda _I \subseteq BW _{2m}^{\#} .$$ The lattices…
Let $m \geq 2$ be an integer, and let $\mathbb{F}_q$ be the finite field of prime power order $q.$ Let $\mathcal{R}=\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}\times \mathbb{F}_q$ be the mixed-alphabet ring, where…
We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a $d$-regular tree…
Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…