Related papers: Weights in Codes and Genus 2 Curves
Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…
We obtain the structure of weight 2 blocks and [2:1]-pairs of q-Schur algebras, and compute explicitly the modular Alvis-Curtis duality for weight 2 blocks of finite general linear groups in non-defining characteristic.
Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…
Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero…
Cyclic codes have wide applications in data storage systems and communication systems. Employing two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field GF}(q) and…
As a subclass of linear codes, cyclic codes have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, five families of three-weight…
We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…
We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…
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…
We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and…
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…
A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…
Binary cyclic codes are worth studying due to their applications and theoretical importance. It is an important problem to construct an infinite family of cyclic codes with large minimum distance $d$ and dual distance $d^{\perp}$. In recent…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
This semi-expository paper discusses the log minimal model program as applied to the moduli space of curves, especially in the case of curves of genus two. Log canonical models for these moduli spaces can often be constructed using the…
We present an index calculus algorithm with double large prime variation which lends itself well to a rigorous analysis. Using this algorithm we prove that for fixed genus $g \geq 2$, the discrete logarithm problem in degree 0 class groups…