Related papers: Boundaries for the Honeycomb Code
An exact formula for the minimal coordination numbers of the parallel packed bundle of rods is presented based on an optimal thickening scenario. Hexagonal and square lattices are considered.
Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…
In this note, we study non-uniqueness for minimizing harmonic maps from $B^3$ to $\mathbb{S}^2$. We show that every boundary map can be modified to a boundary map that admits multiple minimizers of the Dirichlet energy by a small…
Hulls of linear codes have been of interest and extensively studied due to their rich algebraic structures and wide applications. In this paper, alternative characterizations of hulls of linear codes are given as well as their applications.…
In this work we investigate codes in $\mathbb{Z}_{2^m}^n$ that can correct errors that occur in just one coordinate of the codeword, with a magnitude of up to a given parameter $t$. We will show upper bounds on these cross codes, derive…
The bulk-boundary correspondence is a hallmark feature of topological phases of matter. Nonetheless, our understanding of the correspondence remains incomplete for phases with intrinsic topological order, and is nearly entirely lacking for…
Numerical simulations of crystal defects are necessarily restricted to finite computational domains, supplying artificial boundary conditions that emulate the effect of embedding the defect in an effectively infinite crystalline…
In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The $k$-planar crossing number of a graph $cr_k(G)$ is the number of crossings required when every edge of $G$ must be drawn in…
A method for construction of polar subcodes is presented, which aims on minimization of the number of low-weight codewords in the obtained codes, as well as on improved performance under list or sequential decoding. Simulation results are…
We study the term structure equation for single-factor models that predict nonnegative short rates. In particular, we show that the price of a bond or a bond option is the unique classical solution to a parabolic differential equation with…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to…
Bloom filters, cuckoo filters, and other approximate set membership sketches have a wide range of applications. Oftentimes, expensive operations can be skipped if an item is not in a data set. These filters provide an inexpensive, memory…
We derive necessary and sufficient inseparability conditions imposed on the variance matrix of symmetric qubits. These constraints are identified by examining a structural parallelism between continuous variable states and two qubit states.…
Network coding is studied when an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than when the adversary controls a given number of edges in the…
Recently, a novel lookup table based decoding method for binary low-density parity-check codes has attracted considerable attention. In this approach, mutual-information maximizing lookup tables replace the conventional operations of the…
This work arose from efforts to generalise the usual cubical boundary by using different 'weights' for opposite faces, but still to obtain a chain complex, and this method was found to generalise. We describe a variant of the classical…
A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special…
Existence of quantum low-density parity-check (LDPC) codes whose minimal distance scales linearly with the number of qubits is a major open problem in quantum information. Its practical interest stems from the need to protect information in…
We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in…
Constant dimension codes (CDCs), as special subspace codes, have received extensive attention due to their applications in random network coding. The basic problem of CDCs is to determine the maximal possible size $A_q(n,d,\{k\})$ for given…