Related papers: 3-Dimensional Optical Orthogonal Codes with Ideal …
This notes explores angle structures on ideally triangulated compact $3$-manifolds with high genus boundary. We show that the existence of angle structures implies the existence of a hyperbolic metric with totally geodesic boundary, and…
In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…
High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require efficient generation of non-local, many-body entanglement. We provide a linear-optical architecture with these properties,…
It is an attractive hypothesis that the spatial structure of visual cortical architecture can be explained by the coordinated optimization of multiple visual cortical maps representing orientation preference (OP), ocular dominance (OD),…
We construct constant-sized ensembles of linear error-correcting codes over any fixed alphabet that can correct a given fraction of adversarial erasures at rates approaching the Singleton bound arbitrarily closely. We provide several…
Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing. In general, it is difficult to…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested.
In their 2007 book, Tsfasman and Vl\v{a}du\c{t} invite the reader to reinterpret existing coding theory results through the lens of projective systems. Redefining linear codes as projective systems provides a geometric vantage point. In…
Let $R$ be a commutative ring with identity. The paper studies the problem of self-orthogonality and self-duality matrix-product codes (MPCs) over $R$. Some methods as well as special matrices are introduced for the construction of such…
We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement compared with known constructions. For certain asymptotic…
We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and $0D$ defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of…
In a previous study, we presented a construction of spherical 3-designs. In the current study, using this construction, we present new optimal antipodal spherical codes in the space of spherical harmonics. Our construction is a…
The existence of self-correcting quantum memories in three dimensions is a long-standing open question at the interface between quantum computing and many-body physics. We take the perspective that large contributions to the entropy arising…
Self-concordance is the most important property required for barriers in convex programming. It is intrinsically linked to the affine structure of the underlying space. Here we introduce an alternative notion of self-concordance which is…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
We introduce an efficient decoder of the color code in $d\geq 2$ dimensions, the Restriction Decoder, which uses any $d$-dimensional toric code decoder combined with a local lifting procedure to find a recovery operation. We prove that the…
New infinite families of quantum symmetric and asymmetric codes are constructed. Several of these are MDS. The codes obtained are shown to have parameters which are better than previously known. A number of known codes are special cases of…
Three-dimensional (3D) topological codes offer the advantage of supporting fault-tolerant implementations of non-Clifford gates, yet their performance against realistic noise remains largely unexplored. In this work, we focus on the…
In this paper we investigate known Singleton-like bounds in the Lee metric and characterize optimal codes, which turn out to be very few. We then focus on Plotkin-like bounds in the Lee metric and present a new bound that extends and…