Related papers: On a Grobner bases structure associated to linear …
A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…
We give a characterization for the binary linear constant weight codes by using the symmetric difference of the supports of the codewords. This characterization gives a correspondence between the set of binary linear constant weight codes…
Given a G-structure with connection satisfying a regularity assumption we associate to it a classifying Lie algebroid. This algebroid contains all the information about the equivalence problem and is an example of a G-structure Lie…
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems allows for a unique minimal representation of the generated…
In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gr\"obner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree…
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
We investigate a class of algebras on $\mathbb{R}^3$ arising and generalized from the algebraic structure of magnetic gradient fields induced by systems of synchronous magnets with identical dipole moments (i.e.,…
We investigate associativity of multiplications on chain complexes over commutative noetherian rings from two perspectives. First, we introduce a natural associator subcomplex and show how its homology can detect associativity. Second, we…
There are two gradient descent decoding procedures for binary codes proposed independently by Liebler and by Ashikhmin and Barg. Liebler in his paper mentions that both algorithms have the same philosophy but in fact they are rather…
In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
Using a binary representation for basis elements of an algebra combined with a framework of multiplier and index functions, a connection has been established between the structure of a large class of algebras and the XOR componentwise…
We present a bound on the size of linear codes. This bound is independent of other known bounds, e.g. the Griesmer bound.
We provide a self-contained introduction to Gr\"obner bases of submodules of $R[x_1, \ldots, x_n]^k$, where $R$ is a Euclidean domain, and explain how to use these bases to solve linear systems over $R[x_1, \ldots, x_n]$.
Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of linear codes has many applications such as on the type II wire-tap channel, dealing with…
The existence of local bases in which the components of derivations of tensor algebras over a differentiable manifold vanish along paths is proved. The holonomicity of these bases is investigated. The obtained results are applied to the…
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functionalities. The LCE problem asks to determine whether two linear…
We study algebraic geometry linear codes defined by linear sections of the Grassmannian variety as codes associated to FFN$(1,q)$-projective varieties. As a consequence, we show that Schubert, Lagrangian-Grassmannian, and isotropic…
Gr\"obner Bases and Cylindrical Algebraic Decomposition are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a…