Related papers: On affine variety codes from the Klein quartic
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…
We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived…
In this short note, we show that the Ginzburg-Vasserot map between the quantum affine algebra of type A_(n-1) and the equivariant K-theory group of the Steinberg Variety (of n-step flags in C^d) restricts and remains surjective at the level…
We expound on some known lower bounds of the quadratic Wasserstein distance between random vectors in $\mathbb{R}^n$ with an emphasis on affine transformations that have been used in manifold learning of data in Wasserstein space. In…
We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…
We describe a class of toric varieties in the $N$-dimensional affine space which are minimally defined by no less than $N-2$ binomial equations.
Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…
Classical designs and their (projective) q-analogs can both be viewed as designs in matroids, using the matroid of all subsets of a set and the matroid of linearly independent subsets of a vector space, respectively. Another natural matroid…
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…
We study subvarieties of the flag variety called Hessenberg varieties, defined by certain linear conditions. These subvarieties arise naturally in applications including geometric representation theory, number theory, and numerical…
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian…
We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways. First, in relation to Reed-Muller codes: our codes are…
For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…
The paper deals with a new sharp criterion ensuring the Aubin property of solution maps to a class of parameterized variational systems. This class includes parameter-dependent variational inequalities with non-polyhedral constraint sets…
We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…
We classify affine varieties with an action of a connected, reductive algebraic group such that the group is isomorphic to an open orbit in the variety. This is accomplished by associating a set of one-parameter subgroups of the group to…
We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
Let K be a finite field and let X* be an affine algebraic toric set parameterized by monomials. We give an algebraic method, using Groebner bases, to compute the length and the dimension of C_X*(d), the parameterized affine code of degree d…