Related papers: Monomial codes under linear algebra point of view
Let $K[x]$ be a polynomial algebra in a variable $x$ over a commutative $\Q$-algebra $K$, and $\G'$ be the monoid of $K$-algebra monomorphisms of $K[x]$ of the type $\s : x\mapsto x+\l_2x^2+... +\l_nx^n$, $\l_i\in K$, $\l_n$ is a unit of…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
The hull $H(C)$ of a linear code $C$ is defined by $H(C)=C \cap C^\perp$. A linear code with a complementary dual (LCD) is a linear code with $H(C)=\{0\}$. The dimension of the hull of a code is an invariant under permutation equivalence.…
Generalized Goppa codes are defined by a code locator set $\mathcal{L}$ of polynomials and a Goppa polynomial $G(x)$. When the degree of all code locator polynomials in $\mathcal{L}$ is one, generalized Goppa codes are classical Goppa…
We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…
We establish some comparison results among the different parameterized Galois theories for $q$-difference equations, completing the work by CHatzidakis, Hardouin and Singer, that addresses the problem in the case without parameters. Our…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…
We carry out some of Galois's work in the setting of an arbitrary first-order theory T. We replace the ambient algebraically closed field by a large model M of T, replace fields by definably closed subsets of M, assume that T codes finite…
We discuss some research problems on affine monomial curves, from the perspective of computation.
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
We define the monomial invariants of a projective variety $Z$; they are invariants coming from the generic initial ideal of $Z$. Using this notion, we generalize a result of Cook: If $Z$ is an integral variety of codimension two, satisfying…
We consider generalizations of Reed-Muller codes, toric codes, and codes from certain plane curves, such as those defined by norm and trace functions on finite fields. In each case we are interested in codes defined by evaluating arbitrary…
We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…
We introduce the concept of Hopf-Galois system, a reformulation of the notion of Galois extension of the base field for a Hopf algebra. The main feature of our definition is a generalization of the antipode of an ordinary Hopf algebra. The…
We supplement the study of Galois theory for algebraic quantum groups started in the paper 'Galois Theory for Multiplier Hopf Algebras with Integrals' by A. Van Daele and Y.H. Zhang. We examine the structure of the Galois objects: algebras…
We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…
A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.
Recently, it was shown that a binary linear code can be associated to a binomial ideal given as the sum of a toric ideal and a non-prime ideal. Since then two different generalizations have been provided which coincide for the binary case.…
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode…