Related papers: Boundaries for the Honeycomb Code
We present a new method for the numerical implementation of generating boundary conditions for a one dimensional Boussinesq system. This method is based on a reformulation of the equations and a resolution of the dispersive boundary layer…
We describe a three-stage procedure to analyze the dependence of Poisson Boltzmann calculations on the shape, size and geometry of the boundary between solute and solvent. Our study is carried out within the boundary element formalism, but…
A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudo-random nature, and the new…
Quantum low-density parity-check codes, such as the Kitaev toric code and bivariate bicycle codes, are often defined with periodic boundary conditions, which are difficult to realize in physical systems. In this paper, we present an…
In this paper, we present an improved union bound on the Linear Programming (LP) decoding performance of the binary linear codes transmitted over an additive white Gaussian noise channels. The bounding technique is based on the second-order…
We study the boundary control of solutions of the Helmholtz and Maxwell equations to enforce local non-zero constraints. These constraints may represent the local absence of nodal or critical points, or that certain functionals depending on…
A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over…
We describe rules to simplify quantum circuits at their boundaries, i.e. at state preparation and measurement. There, any strictly incoherent operation may be pushed into a pre- or post-processing of classical data. The rules can greatly…
LDPC codes based on multiple-edge protographs potentially have larger minimum distances compared to their counterparts, single-edge protographs. However, considering different features of their Tanner graph, such as short cycles, girth and…
We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…
We consider generalizations of parity polytopes whose variables, in addition to a parity constraint, satisfy certain ordering constraints. More precisely, the variable domain is partitioned into $k$ contiguous groups, and within each group,…
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, and each syndrome bit only relies on some constant number of…
We introduce a hierarchy of conditions necessarily satisfied by any distribution P(ab) representing the probabilities for two separate observers to obtain outcomes a and b when making local measurements on a shared quantum state. Each…
We determine necessary and sufficient conditions for real algebraic curves near the non-singular tropical limit to be hyperbolic with respect to a point, thus generalising Speyer's classification of stable curves near the tropical limit. In…
Analogs of Reed-Solomon codes are introduced within the framework of bottleneck poset metrics. These codes are proven to be maximum distance separable. Furthermore, the results are extended to the setting of Algebraic Geometry codes.
We study uniqueness of an elliptic Riemannian polyhedron using the elliptic version for Boundary Control method, which we presented in [1]. We also present interface detection criteria for hyperbolic Riemannian manifolds through…
We introduce a "hyperbicycle" ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Z\'emor and generalized bicycle codes by MacKay et al. as limiting cases. The construction allows for both…
It is widely accepted that quantum error correction is essential for realizing large-scale fault-tolerant quantum computing. Recent experiments have demonstrated error correction codes operating below threshold, primarily using local planar…
Binary codes are constructed from incidence matrices of hypergraphs. A combinatroial description is given for the minimum distances of such codes via a combinatorial tool called ``eonv". This combinatorial approach provides a faster…
Polynomial spectral methods produce fast, accurate, and flexible solvers for broad ranges of PDEs with one bounded dimension, where the incorporation of general boundary conditions is well understood. However, automating extensions to…