Related papers: 3-Dimensional Optical Orthogonal Codes with Ideal …
We study optimal reconstruction codes over the multiple-burst substitution channel. Our main contribution is establishing a trade-off between the error-correction capability of the code, the number of reads used in the reconstruction…
The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet…
The O(3) nonlinear sigma model with boundary, in dimension two, is considered. An algorithm to determine all its soliton solutions that preserve a rotational symmetry in the boundary is exhibited. This nonlinear problem is reduced to that…
A flag $C_0 \subsetneq C_1 \cdots \subsetneq C_s \subsetneq {\mathbb F}_q^n $ of linear codes is said to be self-orthogonal if the duals of the codes in the flag satisfy $C_{i}^\perp=C_{s-i}$, and it is said to satisfy the isometry-dual…
We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound,…
We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…
This paper considers "geometric" ideal triangulations of cusped hyperbolic 3-manifolds, i.e. decompositions into positive volume ideal hyperbolic tetrahedra. We exhibit infinitely many geometric ideal triangulations of the figure eight knot…
Let $\X$ be an algebraic curve of genus $g \geq 2$ defined over a field $\F_q$ of characteristic $p > 0$. From $\X$, under certain conditions, we can construct an algebraic geometry code $C$. If the code $C$ is self-orthogonal under the…
Constacyclic codes are important classes of linear codes that have been applied to the construction of quantum codes. Six new families of asymmetric quantum codes derived from constacyclic codes are constructed in this paper. Moreover, the…
Recently, Yaakobi et al. introduced codes for $b$-symbol read channels, where the read operation is performed as a consecutive sequence of $b>2$ symbols. In this paper, we establish a Singleton-type bound on $b$-symbol codes. Codes meeting…
In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including…
Locally repairable codes (LRCs) have emerged as an important coding scheme in distributed storage systems (DSSs) with relatively low repair cost by accessing fewer non-failure nodes. Theoretical bounds and optimal constructions of LRCs have…
In this work, we propose two criteria for linear codes obtained from the Plotkin sum construction being symplectic self-orthogonal (SO) and linear complementary dual (LCD). As specific constructions, several classes of symplectic SO codes…
We find an exact general solution to the three-dimensional (3D) Ising model via an exact self-consistency equation for nearest-neighbors' correlations. It is derived by means of an exact solution to the recurrence equations for partial…
In Part I of this paper we discussed new methods for the numerical continuation of point-to-cycle connecting orbits in 3-dimensional autonomous ODE's using projection boundary conditions. In this second part we extend the method to the…
We propose the autocorrelator of conductance peak heights as a signature of the underlying chaotic dynamics in quantum dots in the Coulomb blockade regime. This correlation function is directly accessible to experiments and its decay width…
Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code length derived in this paper. The length of the constructed…
Practical large-scale quantum computation requires both efficient error correction and robust implementation of logical operations. Three-dimensional (3D) color codes are a promising candidate for fault-tolerant quantum computation due to…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…