Related papers: Stabilizer codes of less than two dimensions have …
We solve one of the oldest problems in the theory of quantum stabilizer codes by proving the non-existence of quantum [[13,5,4]]-codes.
Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…
An expander code is a binary linear code whose parity-check matrix is the bi-adjacency matrix of a bipartite expander graph. We provide a new formula for the minimum distance of such codes. We also provide a new proof of the result that…
Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive quantum error correcting codes. Codes of distance 2…
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that is linear in their code length, and (iii) they have a…
The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of…
One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. In past years, many good quantum error-correcting codes had been…
We study the hardness of the problem of finding the distance of quantum error-correcting codes. The analogous problem for classical codes is known to be NP-hard, even in approximate form. For quantum codes, various problems related to…
We prove a new bound for the minimum distance of geometric Goppa codes that generalizes two previous improved bounds. We include examples of the bound to one and two point codes over both the Suzuki and Hermitian curves.
In recent years, there have been many studies on local stabilizer codes. Under the assumption of translation and scale invariance Yoshida classified such codes. His result implies that translation invariant 2D color codes are equivalent to…
Spatially-coupled (SC) codes are constructed by coupling many regular low-density parity-check codes in a chain. The decoding chain of SC codes stops when facing burst erasures. This problem can not be overcome by increasing coupling…
In this note, we show that the solution to the Dirichlet problem for the minimal surface system in any codimension is unique in the space of distance-decreasing maps. This follows as a corollary of the following stability theorem: if a…
The aim of this work is to study homogeneous stable solutions to the thin (or fractional) one-phase free boundary problem. The problem of classifying stable (or minimal) homogeneous solutions in dimensions $n\geq3$ is completely open. In…
We present new constructions of quantum codes of linear or close-to-linear distance and dimension with low-weight stabilizers. Only a few constructions of such codes were previously known, and were primarily based on a specific operation…
The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…
We show that the generalized minimum distance function is non-increasing as the degree varies for reduced standard graded algebras over a field. This allows us to define its regularity index and its stabilization value. The stabilization…
We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…
If $S$ is a transitive metric space, then $|C|\cdot|A| \le |S|$ for any distance-$d$ code $C$ and a set $A$, ``anticode'', of diameter less than $d$. For every Steiner S$(t,k,n)$ system $S$, we show the existence of a $q$-ary…
Two types of stability boundaries exist for any planetary system consisting of one star and two planets. Lagrange stability requires that the planets remain bound to the star, conserves the ordering of the distance from the star, and limits…
The color code is a topological quantum error-correcting code supporting a variety of valuable fault-tolerant logical gates. Its two-dimensional version, the triangular color code, may soon be realized with currently available…