Related papers: Constructive spherical codes on layers of flat tor…
The color code model is a crucial instance of a Calderbank--Shor--Steane (CSS)-type topological quantum error-correcting code, which notably supports transversal implementation of the full Clifford group. Its robustness against local noise…
We consider in this paper the design of full diversity and high rate space-time codes with moderate decoding complexity for arbitrary number of transmit and receive antennas and arbitrary input alphabets. We focus our attention to codes…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
We give the parameters of any evaluation code on a smooth quadric surface. For hyperbolic quadrics the approach uses elementary results on product codes and the parameters of codes on elliptic quadrics are obtained by detecting a BCH…
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…
Digital circles not only play an important role in various technological settings, but also provide a lively playground for more fundamental number-theoretical questions. In this paper, we present a new recursive algorithm for the…
The surface code is a leading candidate quantum error correcting code, owing to its high threshold, and compatibility with existing experimental architectures. Bravyi et al. (2006) showed that encoding a state in the surface code using…
We construct a template with two ribbons that describes the topology of all periodic orbits of the geodesic flow on the unit tangent bundle to any sphere with three cone points with hyperbolic metric. The construction relies on the…
Hyperplane codes are a class of convex codes that arise as the output of a one layer feed-forward neural network. Here we establish several natural properties of stable hyperplane codes in terms of the {\it polar complex} of the code, a…
The possibility of using the two-fold topological degeneracy of spin-1/2 chiral spin liquid states on the torus to construct quantum error correcting codes is investigated. It is shown that codes constructed using these states on finite…
Two new constructions are presented for coils and snakes in the hypercube. Improvements are made on the best known results for snake-in-the-box coils of dimensions 9, 10 and 11, and for some other circuit codes of dimensions between 8 and…
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes. We show that the minimum distance is multiplicative with respect to taking the product of polytopes, and behaves…
Quantum error correction is essential for the development of any scalable quantum computer. In this work we introduce a generalization of a quantum interleaving method for combating clusters of errors in toric quantum error-correcting…
Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The complexity of the SD has been shown to be exponential in some cases,…
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…
Spherical $t$-designs are finite point sets on the unit sphere that enable exact integration of polynomials of degree at most $t$ via equal-weight quadrature. This concept has recently been extended to spherical $t$-design curves by the use…
Lattices and partially ordered sets have played an increasingly important role in coding theory, providing combinatorial frameworks for studying structural and algebraic properties of error-correcting codes. Motivated by recent works…
Here we study an efficient algorithm for decoding the topological codes. It is based on a simple principle, which should allow straightforward generalization to complex decoding problems. It is benchmarked with the planar code for both…
In this paper, we apply the Clique Lov\'asz Local Lemma to provide sufficient conditions on memory and lifting degree for removing certain harmful combinatorial structures in spatially-coupled (SC) codes that negatively impact decoding…