Related papers: Linear codes with arbitrary dimensional hull and p…
Finding a mass formula for a given class of linear codes is a fundamental problem in combinatorics and coding theory. In this paper, we consider the action of the unitary (resp. symplectic) group on the set of all Hermitian (resp.…
We say that a binary linear code C has a geometric representation if there exists a two dimensional simplicial complex D such that C is a punctured code of the kernel ker D of the incidence matrix of D and dim C = dim ker D. We show that…
In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…
Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual…
The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…
Linear codes for error detection on a q-ary symmetric channel are studied. It is shown that for given dimension k and minimum distance d, there exists a value \mu(d,k) such that if C is a code of length n >= \mu(d,k), then neither C nor its…
In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square $q$,…
MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. In this paper, we focus on a class of linear codes and…
A linear code $C$ over $\mathbb{F}_q$ is called $\Delta$-divisible if the Hamming weights $\operatorname{wt}(c)$ of all codewords $c \in C$ are divisible by $\Delta$. The possible effective lengths of $q^r$-divisible codes have been…
The hulls of linear and cyclic codes over finite fields have been of interest and extensively studied due to their wide applications. In this paper, the hulls of cyclic codes of length $n$ over the ring $\mathbb{Z}_4$ have been focused on.…
Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric…
Given a finite field F_q and a positive integer n, a flag is a sequence of nested F_q-subspaces of a vector space F_q^n and a flag code is a nonempty collection of flags. The projected codes of a flag code are the constant dimension codes…
Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors…
Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size $q$ of the underlying field $\mathbb{F}_q$. In this paper we present a code construction which…
We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
A linear code over $\mathbb{F}_q$ with the Hamming metric is called $\Delta$-divisible if the weights of all codewords are divisible by $\Delta$. They have been introduced by Harold Ward a few decades ago. Applications include subspace…
The $\Z_{p^s}$-additive codes of length $n$ are subgroups of $\Z_{p^s}^n$, and can be seen as a generalization of linear codes over $\Z_2$, $\Z_4$, or $\Z_{2^s}$ in general. A $\Z_{p^s}$-linear generalized Hadamard (GH) code is a GH code…