Related papers: On completely regular and completely transitive co…
It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…
The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b,…
LCD codes are linear codes that intersect with their dual trivially. Quasi cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are…
In this paper we consider a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and find that under some natural algebraic conditions of the codes their empirical spectral…
Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes -- the generalized covering radius. The generalized covering-radius hierarchy of a…
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,…
Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…
Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…
Many kinds of codes which possess two cycle structures over two special finite commutative chain rings, such as ${\Bbb Z}_2{\Bbb Z}_4$-additive cyclic codes and quasi-cyclic codes of fractional index etc., were proved asymptotically good.…
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…
Let R be an associative ring with unity and let M be an R-module. We call M (ample) Rad-supplementing if M has a (ample) Rad-supplement in every extension. If M is Rad-supplementing, then every direct summand of M is Rad-supplementing, but…
Butson matrices are complex Hadamard matrices with entries in the complex roots of unity of given order. There is an interesting code in phase space related to this matrix (Armario et al. 2023). We study the covering radius of Butson…
This paper is concerned with construction and structural analysis of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three parts. The first part shows that a cyclic code given by a parity-check matrix in…
In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define…
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product. Upper bounds on covering codes in NRT spaces are also…
Let p>3 be an odd prime and m be a positive integer. Little progress on the study of optimal p-ary cyclic codes with parameters [p^m-1,p^m-2m-2,4] has been made.In this paper, by weakening the necessary and sufficient conditions on cyclic…
This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…
We consider $\mathcal{PT}$-symmetric ring-like arrays of optical waveguides with purely nonlinear gain and loss. Regardless of the value of the gain-loss coefficient, these systems are protected from spontaneous $\mathcal{PT}$-symmetry…
Some properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16 are presented for reference purposes.
Two submatrices $A,D$ of a Hadamard matrix $H$ are called complementary if, up to a permutation of rows and columns, $H=[^A_C{\ }^B_D]$. We find here an explicit formula for the polar decomposition of $D$. As an application, we show that…