Related papers: A further study on the mass formula for linear cod…
Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…
Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear…
Linear complementary dual (LCD) codes is a class of linear codes introduced by Massey in 1964. LCD codes have been extensively studied in literature recently. In addition to their applications in data storage, communications systems, and…
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…
The hull of a linear code over finite fields is the intersection of the code and its dual, which was introduced by Assmus and Key. In this paper, we develop a method to construct linear codes with trivial hull ( LCD codes) and…
Let $\mathtt{R}$ be a finite commutative chain ring with the maximal ideal $\gamma\mathtt{R}$ of nilpotency index $e\geq 2,$ and let $\check{\mathtt{R}}=\mathtt{R}/\gamma^{s}\mathtt{R}$ for some positive integer $ s< e.$ In this paper, we…
The paper deals with the problem of deciding if two finite-dimensional linear subspaces over an arbitrary field are identical up to a permutation of the coordinates. This problem is referred to as the permutation code equivalence. We show…
We study the asymptotic behavior of double and four circulant codes, which are quasi-cyclic codes of index two and four respectively. Exact enumeration results are derived for these families of codes with the prescribed hull dimension.…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions,…
In this article we compute the mass associated to any unimodular lattice in a Hermitian space over an arbitrary CM field under a condition at 2. We study the geometry and arithmetic of the basic locus of the GU(r,s)-Shimura variety…
This paper gives explicit formulas for the formal total mass Dirichlet series for integer-valued ternary quadratic lattices of varying determinant and fixed signature over number fields F where p = 2 splits completely. We prove this by…
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…
In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…
This study investigates Hermitian rank-metric codes, a special class of rank-metric codes, focusing on perfect codes and on the analysis of their covering properties. Firstly, we establish bounds on the size of spheres in the space of…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
Throughout this paper, we conduct our discussion by a partial review of Elko's Hermiticity, introducing the Hermitian formulation for interacting mass dimension one fermions based on Elko spinor. It includes pivotal observations about…
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…
Let $\cal M$ denote the set ${\cal S}_{n, q}$ of $n \times n$ symmetric matrices with entries in ${\rm GF}(q)$ or the set ${\cal H}_{n, q^2}$ of $n \times n$ Hermitian matrices whose elements are in ${\rm GF}(q^2)$. Then $\cal M$ equipped…
The largest minimum weights among quaternary Hermitian linear complementary dual codes are known for dimension $2$. In this paper, we give some conditions for the nonexistence of quaternary Hermitian linear complementary dual codes with…