Related papers: One-Generator Quasi-Abelian Codes Revisited
This paper studies a class of Abelian varieties that are of $\GL_2$-type and with isogenous classes defined over a number field $k$. We treat the cases when their endomorphism algebras are either (1) a totally real field $K$ or (2) a…
Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic…
Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from…
New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths.…
We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or…
We study quasi-semisimple elements of disconnected reductive algebraic groups over an algebraically closed field. We describe their centralizers, define isolated and quasi-isolated quasi-semisimple elements and classify their conjugacy…
A careful exposition of Zilber's quasiminimal excellent classes and their categoricity is given, leading to two new results: the L_w1,w(Q)-definability assumption may be dropped, and each class is determined by its model of dimension…
The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…
We present an introduction to the theory of algebraic geometry codes. Starting from evaluation codes and codes from order and weight functions, special attention is given to one-point codes and, in particular, to the family of Castle codes.
The results of J. F. Qiann et al. [4] on $(1-\gamma)$-cyclic codes over finite chain rings of nilpotency index 2 are extended to $(1-\gamma^e)$-cyclic codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map is…
Algebraic Geometric codes associated to a recently discovered class of maximal curves are investigated. As a result, some linear codes with better parameters with respect to the previously known ones are discovered, and 70 improvements on…
We revisit the finite Abelian hidden subgroup problem (AHSP) from a mathematical perspective and make the following contributions. First, by employing amplitude amplification, we present an exact quantum algorithm for the finite AHSP, our…
The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the…
In this paper, we study algebraic geometry codes from curves over $\mathbb{F}_{q^\ell}$ through their virtual projections which are algebraic geometric codes over $\mathbb{F}_q$. We use the virtual projections to provide fractional decoding…
In this work, we introduce a new class of Leibniz algebras, called quasi-Artinian Leibniz algebras, which generalizes the minimal condition on ideals. Furthermore, we provide some characterizations and give conditions under which a…
The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance…
In this paper, we classify the possible group structures on the set of $R$-valued points of an abelian variety, where $R$ is any real closed field. We make use of a family of abelian varieties that, in effect, allows one to quantify over…
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…
We consider linear codes over a field in which the error values are restricted to a subgroup of its unit group. This scenario captures Lee distance codes as well as codes over the Gaussian or Eisenstein integers. Codes correcting restricted…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…