Related papers: Non-split toric BCH codes on singular del Pezzo su…
We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…
Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…
In this paper we prove new lower bounds for the minimum distance of a toric surface code defined by a convex lattice polygon P. The bounds involve a geometric invariant L(P), called the full Minkowski length of P which can be easily…
Toric codes are evaluation codes obtained from an integral convex polytope $P \subset \R^n$ and finite field $\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner.…
The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially when it comes to cyclic codes. Recently, the first infinite…
Cyclic codes are an important class of linear codes. Bounding the minimum distance of cyclic codes is a long-standing research topic in coding theory, and several well-known and basic results have been developed on this topic. Recently,…
Codes defined on graphs and their properties have been subjects of intense recent research. On the practical side, constructions for capacity-approaching codes are graphical. On the theoretical side, codes on graphs provide several…
We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…
Suppose $\mathcal{E} \to B$ is a non-isotrivial elliptic surface defined over a number field, for smooth projective curve $B$. Let $k$ denote the function field $\overline{\mathbb{Q}}(B)$ and $E$ the associated elliptic curve over $k$. In…
We give upper bounds for the number of rational points of bounded anti-canonical height on del Pezzo surfaces of degree at most five over any global field whose characteristic is not equal to two or three. For number fields these results…
Topological quantum codes, such as toric and surface codes, are excellent candidates for hardware implementation due to their robustness against errors and their local interactions between qubits. However, decoding these codes efficiently…
We solve categorical Torelli problem for quartic del Pezzo surfaces. That is, we prove that a del Pezzo surface of degree $4$ can be canonically reconstructed from its Kuznetsov component, which is the orthogonal subcategory to the…
We construct a klt del Pezzo surface which is not globally F-split, over any algebraically closed field of positive characteristic.
We give an explicitly computable lower bound for the arithmetic self-intersection number of the dualizing sheaf on a large class of arithmetic surfaces. If some technical conditions are satisfied, then this lower bound is positive. In…
In an earlier work, the first author and Petsche used potential theoretic techniques to establish a lower bound for the height of algebraic numbers that satisfy splitting conditions, such as being totally real or p-adic, improving on…
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated…
Let $A(n, d)$ denote the maximum size of a binary code of length $n$ and minimum Hamming distance $d$. Studying $A(n, d)$, including efforts to determine it as well to derive bounds on $A(n, d)$ for large $n$'s, is one of the most…
BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In the past sixty years, a lot of progress on the study of BCH codes has been made, but little is known about the properties of…
We report on our project to construct non-singular cubic surfaces over $\bbQ$ with a rational line. Our method is to start with degree 4 Del Pezzo surfaces in diagonal form. For these, we develop an explicit version of Galois descent.
We generalize a construction of non-binary quantum LDPC codes over $\F_{2^m}$ due to \cite{KHIS11a} and apply it in particular to toric codes. We obtain in this way not only codes with better rates than toric codes but also improve…