Related papers: On affine variety codes from the Klein quartic
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
On a Goppa code whose structure polynomial has coefficients in the symbol field, the Frobenius acts. Its fixed codewords form a subcode. Deleting the naturally occurred redundance, we obtain a new code. It is proved that these new codes…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
Let us consider a specialization of an untwisted quantum affine algebra of type $ADE$ at a nonzero complex number, which may or may not be a root of unity. The Grothendieck ring of its finite dimensional representations has two bases,…
We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…
Many algorithms in numerical analysis are affine equivariant: they are immune to changes of affine coordinates. This is because those algorithms are defined using affine invariant constructions. There is, however, a crucial ingredient…
We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from…
Consider a one-parameter family of algebraic varieties degenerating to a reducible one. Our main result is a formula for the fundamental cycle of the limit subscheme of any family of effective Cartier divisors. The formula expresses this…
We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…
We prove a conjecture of Kleinbock which gives a clear-cut classification of all extremal affine subspaces of $\mathbb{R}^n$. We also give an essentially complete classification of all Khintchine type affine subspaces, except for some…
An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by…
Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…
Let $F$ be a field and let $F^{r\times s}$ denote the space of $r\times s$ matrices over $F$. Given equinumerous subsets $\mathcal{A}=\{A_i\mid i \in I\}\subseteq F^{r\times r}$ and $\mathcal{B}=\{B_i\mid i\in I\}\subseteq F^{s\times s}$ we…
We relate a certain category of sheaves of k-vector spaces on a complex affine Schubert variety to modules over the k-Lie algebra (for ch k>0) or to modules over the small quantum group (for ch k=0) associated to the Langlands dual root…
Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing…
This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
A notion of Drinfeld polynomials is introduced for modules of two-parameter quantum affine algebras. Finite dimensional representations are then characterized by sets of $l$-tuples of pairs of Drinfeld polynomials with certain conditions.
Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…