Related papers: Non-split toric BCH codes on singular del Pezzo su…
Due to wide applications of BCH codes, the determination of their minimum distance is of great interest. However, this is a very challenging problem for which few theoretical results have been reported in the last four decades. Even for the…
For each integer $k \geq 2$, we apply gluing methods to construct sequences of minimal surfaces embedded in the round $3$-sphere. We produce two types of sequences, all desingularizing collections of intersecting Clifford tori. Sequences of…
Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…
Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions. In this paper, we give the following three results. 1) If $\lambda|q^{sm}-1$ and $\lambda…
Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a…
Let Q -> B be a quadric fibration and T -> B a family of sextic du Val del Pezzo surfaces. Making use of the recent theory of noncommutative mixed motives, we establish a precise relation between the Schur-finiteness conjecture for Q, resp.…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
Surface and color codes are two forms of topological quantum error correction in two spatial dimensions with complementary properties. Surface codes have lower-depth error detection circuits and well-developed decoders to interpret and…
Surface codes are a promising method of quantum error correction and the basis of many proposed quantum computation implementations. However, their efficient decoding is still not fully explored. Recently, approaches based on machine…
For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…
For each integer m>1 and l>0 we construct a pair of compact embedded minimal surfaces of genus 1+4m(m-1)l. These surfaces desingularize the m Clifford tori meeting each other along a great circle at the angle of \pi/m. They are invariant…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…
An attractive feature of BCH codes is that one can infer valuable information from their design parameters (length, size of the finite field, and designed distance), such as bounds on the minimum distance and dimension of the code. In this…
Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over $\mathbb{Q}$ that contains a conic defined over $\mathbb{Q}$.
Minimal surfaces in closed 3-manifolds are classically constructed via the Almgren-Pitts approach. The Allen-Cahn approximation has proved to be a powerful alternative, and Chodosh and Mantoulidis (in Ann. Math. 2020) used it to give a new…
Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a…