Related papers: Affine Symplectic Grassmann codes
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…
Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb…
We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is…
In this paper, new few weights linear codes over the local ring $R=\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ with $u^2=v^2=0, uv=vu,$ are constructed by using the trace function defined over an extension ring of degree $m.$…
We consider any classical Grassmannian geometry $\Gamma$; that is, any projective or polar Grassmann space. Suppose every line in $\Gamma$ contains $s+1$ points. Then we classify all sets of points in $\Gamma$ of cardinality $s+1$, with the…
We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n,k. Among these new codes there is an optimal ternary…
It is well-known that the coset spaces G(k((z)))/G(k[[z]]), for a reductive group G over a field k, carry the geometric structure of an inductive limit of projective k-schemes. This k-ind-scheme is known as the affine Grassmannian for G.…
We study the new problem of Huffman-like codes subject to individual restrictions on the code-word lengths of a subset of the source words. These are prefix codes with minimal expected code-word length for a random source where additionally…
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research…
In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…
The Schubert bases of the torus-equivariant homology and cohomology rings of the affine Grassmannian of the special linear group are realized by new families of symmetric functions called k-double Schur functions and affine double Schur…
This paper tackles the challenge of teaching code semantics to Large Language Models (LLMs) for program analysis by incorporating code symmetries into the model architecture. We introduce a group-theoretic framework that defines code…
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…
In this paper we construct a new optimal code with parameters [120, 60, 20] of type II with an automorphism of order 29. Furthermore we classify all extremal codes with length 60 of type I with an automorphism of this order.
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes, namely, constant-composition codes, nonbinary constant-weight codes and multiply constant-weight codes. This was achieved via an…
The parameters of the AG codes on general linear groups are found. The hyperplane sections having the minimum (or maximum) number of rational points are determined.
In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding…
We prove a version of the Gindikin-Karpelevich formula for untwisted affine Kac-Moody groups over a local field of positive characteristic. The proof is geometric and it is based on the results of [1] about intersection cohomology of…