Related papers: $\ell$-Complementary Subspaces and Codes in Finite…
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…
In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block…
The projective space of order $n$ over the finite field $\Fq$, denoted here as $\Ps$, is the set of all subspaces of the vector space $\Fqn$. The projective space can be endowed with distance function $d_S(X,Y) = \dim(X) + \dim(Y) -…
In this paper we study duality for evaluation codes on intersections of d hypersurfaces with given d-dimensional Newton polytopes, so called toric complete intersection codes. In particular, we give a condition for such a code to be…
Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…
This work is devoted to the investigation of the problem about inverse mapping systems expansions of ultrauniform spaces $X$ using polyhedra over non-Archimedean locally compact fields $\bf L$. Theorems about expansions of complete…
For a linear code $C$ over a finite field, if its dual code $C^{\perp}$ is equivalent to itself, then the code $C$ is said to be {\it isometry-dual}. In this paper, we first confirm a conjecture about the isometry-dual MDS elliptic codes…
Generalizing the linear complementary duals, the linear complementary pairs and the hull of codes, we introduce the concept of $\ell$-dimension linear intersection pairs ($\ell$-DLIPs) of codes over a finite commutative ring $(R)$, for some…
The use of high-dimensional features has become a normal practice in many computer vision applications. The large dimension of these features is a limiting factor upon the number of data points which may be effectively stored and processed,…
There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…
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…
In this paper we introduce a notion of dimension and codimension for every element of a distributive bounded lattice $L$. These notions prove to have a good behavior when $L$ is a co-Heyting algebra. In this case the codimension gives rise…
Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…
The global symmetry algebras of partially-massless (PM) higher-spin (HS) fields in (A)dS$_{d+1}$ are studied. The algebras involving PM generators up to depth $2\,(\ell-1)$ are defined as the maximal symmetries of free conformal scalar…
We revisit and extend the connections between $\mathbb{F}_{q^m}$-linear rank-metric codes and evasive $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We give a unifying framework in which we prove in an elementary way how the parameters…
This paper analyzes the asymptotic exponent of the weight spectrum for irregular doubly-generalized LDPC (D-GLDPC) codes. In the process, an efficient numerical technique for its evaluation is presented, involving the solution of a 4 x 4…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
We study numerically the fully nonlinear gravitational collapse of a self-gravitating, minimally-coupled, massless scalar field in spherical symmetry. Our numerical code is based on double-null coordinates and on free evolution of the…
We initiate the rigorous study of classification in semimetric spaces, which are point sets with a distance function that is non-negative and symmetric, but need not satisfy the triangle inequality. For metric spaces, the doubling dimension…
In this paper motivated from subspace coding we introduce subspace-metric codes and subset-metric codes. These are coordinate-position independent pseudometrics and suitable for the folded codes. The half-Singleton upper bounds for linear…