Related papers: On a class of twisted elliptic curve codes
Motivated by recent advances in locally testable codes and quantum LDPCs based on robust testability of tensor product codes, we explore the local testability of tensor products of (an abstraction of) algebraic geometry codes. Such codes…
The multidimensional convolutional codes are an extension of the notion of convolutional codes (CCs) to several dimensions of time. This paper explores the class of two-dimensional convolutional codes (2D CCs) and 2D tail-biting…
A new type of link between geometry of symplectic group and entanglement-assisted (EA) quantum error-correcting codes (EAQECCs) is presented. Relations of symplectic subspaces and quaternary additive codes concerning parameters of EAQECCs…
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…
This paper is concerned with construction and structural analysis of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three parts. The first part shows that a cyclic code given by a parity-check matrix in…
In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let $m=2\ell+1$ for an integer $\ell\geq 1$…
In [10] it was shown that there is a mapping class group-equivariant deformation retraction of the Teichm\"uller space of a closed surface onto a CW complex with dimension equal to the virtual cohomological dimension of the mapping class…
In this paper, we present a new method for explicitly constructing regular low-density parity-check (LDPC) codes based on $\mathbb{S}_{n}(\mathbb{F}_{q})$, the space of $n\times n$ symmetric matrices over $\mathbb{F}_{q}$. Using this…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
We propose and investigate a numerical shooting method for computing geodesics in the Weil-Petersson ($WP$) metric on the universal Teichm\"uller space T(1). This space, or rather the coset subspace $\PSL_2(\R)\backslash\Diff(S^1)$, has…
Quantum low-density parity-check (qLDPC) codes are promising candidates for fault-tolerant quantum computation due to their high encoding rates and distances. However, implementing logical operations using qLDPC codes presents significant…
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…
Consider genus g curves that admit degree d covers to an elliptic curve simply branched at 2g-2 points. Vary a branch point and the locus of such covers forms a one-parameter family W. We investigate the geometry of W by using admissible…
We introduce a procedure for constructing a generalized elliptic curve from a genus-one twisted curve, and we use this procedure to define an explicit, modular isomorphism between two compactifications of moduli stacks of elliptic curves…
The Teukolsky Master Equation is the basic tool for study of perturbations of the Kerr metric in linear approximation. It admits separation of variables, thus yielding the Teukolsky Radial Equation and the Teukolsky Angular Equation. We…
We define the Euclidean hull of a linear code $C$ as the intersection of $C$ and its Euclidean dual $C^\perp$. The hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing…
We propose a family of gradient reconstruction schemes based on the solution of over-determined systems by orthogonal or oblique projections. In the case of orthogonal projections, we retrieve familiar weighted least-squares gradients, but…
Consider degenerations of Abelian differentials with prescribed number and multiplicity of zeros and poles. Motivated by the theory of limit linear series, we define twisted canonical divisors on pointed nodal curves to study degenerate…
The Thurston metric on Teichmuller space, first introduced by W. P. Thurston is an asymmetric metric on Teichmuller space defined by $d_{Th}(X,Y) = \frac12 log\sup_{\alpha} \frac{l_{\alpha}(Y)}{l_{\alpha}(X)}$. This metric is geodesic, but…