Related papers: Toric codes over finite fields
Let $X$ be a complete $\Q$-factorial toric variety of dimension $n$ and $\del$ the fan in a lattice $N$ associated to $X$. For each cone $\sigma$ of $\del$ there corresponds an orbit closure $V(\sigma)$ of the action of complex torus on…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…
In this article, we investigate properties of cyclic codes over a finite non-chain ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,$ where $q=p^r,$ $r$ is a positive integer, $p$ is an odd prime, $4 \mid…
We prove that for any additive noise channel over $\mathbb{F}_q$, there exist error-correcting codes approaching channel capacity encodable by arithmetic circuits (with weighted addition gates) over $\mathbb{F}_q$ of size $O(n)$ and depth…
Starting with an explicit framework for designing logical Clifford circuits for CSS codes, we construct logical gates for Hypergraph Product Codes. We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which…
Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…
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 investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show that list decodability of every symbol-pair code does not exceed the Gilbert-Varshamov bound. On the other hand, we are able to prove that with…
Neural codes are binary codes in $\{0,1\}^n$; here we focus on the ones which represent the firing patterns of a type of neurons called place cells. There is much interest in determining which neural codes can be realized by a collection of…
A toric quantum error-correcting code construction procedure is presented in this work. A new class of an infinite family of toric quantum codes is provided by constructing a classical cyclic code on the square lattice $\mathbb{Z}_{q}\times…
These notes survey some basic results in toric varieties over a field with examples and applications. A computer algebra package (written by the second author) is described which deals with both affine and projective toric varieties in any…
Given their potential for fault-tolerant operations, topological quantum states are currently the focus of intense activity. Of particular interest are topological quantum error correction codes, such as the surface and planar stabilizer…
Toric surface codes are a class of error-correcting codes coming from a lattice polytope defining a two-dimensional toric variety. Previous authors have mostly completed classifications of these toric surface codes with dimension up to $k =…
Quantum error correction requires decoders that are both accurate and efficient. To this end, union-find decoding has emerged as a promising candidate for error correction on the surface code. In this work, we benchmark a weighted variant…
In this paper, we study the redundancy of linear codes with graph constraints. First we consider linear parity check codes based on bipartite graphs with diversity and with generalized graph constraints. We describe sufficient conditions on…
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…
In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of voltage graphs and Paley graphs in the Galois field GF(pr), where p is a…
Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…
We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…
In this paper, we define two numbers. One comes from counting tropical curves with a stop and the other is the number of holomorphic discs in toric varieties with Lagrangian boundary condition. Both of these curves should satisfy some…