Related papers: On a Grobner bases structure associated to linear …

In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…

We show how, given a straight-line program with $g$ rules for a binary string $B$ of length $n$, in $O(g^{2 / 3} n^{4 / 3})$ time we can build a linear-space index such that, given $m$ and $c$, in O(1) time we can determine whether there is…

In the last time some papers were devoted to the study of the con- nections between binary block codes and BCK-algebras. In this paper, we try to generalize these results to n-ary block codes, providing an algorithm which allows us to…

We discuss a homological method for transferring algebra structures on complexes along suitably nice homotopy equivalences, including those obtained after an application of the Perturbation Lemma. We study the implications for the Homotopy…

We consider the decomposition of bounded linear operators on Hilbert spaces in terms of functions forming frames. Similar to the singular-value decomposition, the resulting frame decompositions encode information on the structure and…

Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…

Here we prove that for dilatation structures linearity (see arXiv:0705.1440v1) is equivalent to a statement about the inverse semigroup generated by the family of dilatations of the space. The result is new for Carnot groups and the proof…

We determine the cup-length of some oriented Grassmann manifolds by finding a Groebner basis associated with a certain subring of the cohomology of them. As its applications, we provide not only a lower but also an upper bound for the…

Structured canonical forms under unitary and suitable structure-preserving similarity transformations for normal and (skew-)Hamiltonian as well as normal and per(skew)-Hermitian matrices are proposed. Moreover, an algorithm for computing…

A Code loop on a binary linear code that is doubly even with a factor set is shown to be a central loop, conjugacy closed loop, Burn loop and extra loop. General forms of the identities that define the factor set of a code are deduced.

We target the problem of provably computing the equivalence between two complex expression trees. To this end, we formalize the problem of equivalence between two such programs as finding a set of semantics-preserving rewrite rules from one…

An explicit formula for a weight enumerator of linear-congruence codes is provided. This extends the work of Bibak and Milenkovic [IEEE ISIT (2018) 431-435] addressing the binary case to the non-binary case. Furthermore, the extension…

We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…

By employing the (de)homogenization technique in a relatively extensive setting, this note studies in detail the relation between non-homogeneous Gr\"obner bases and homogeneous Gr\"obner bases. As a consequence, a general principle of…

A brief description of tree structured sparse coding on the binary cube.

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is rooted in proof theory…

It is shown that commutator identities on associative algebras generate solutions of linearized integrable equations. Next, a special kind of the dressing procedure is suggested that in a special class of integral operators enables to…