Related papers: Embedding Constructions of Tail-Biting Trellises f…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We…
We propose a new method for constructing small-bias spaces through a combination of Hermitian codes. For a class of parameters our multisets are much faster to construct than what can be achieved by use of the traditional algebraic…
Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…
We introduce a new family of binary linear codes suitable for steganographic matrix embedding. The main characteristic of the codes is the staircase random block structure of the generator matrix. We propose an efficient list decoding…
In a group trellis, the sequence of branches that split from the identity path and merge to the identity path form two normal chains. The Schreier refinement theorem can be applied to these two normal chains. The refinement of the two…
We present a generalisation of Twisted Reed-Solomon codes containing a new large class of MDS codes. We prove that the code class contains a large subfamily that is closed under duality. Furthermore, we study the Schur squares of the new…
We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with…
The isometric embedding of surfaces in three-dimensional space is fundamental to various physical systems, from elastic sheets to programmable materials. While continuous surfaces typically admit unique solutions under suitable boundary…
The two-terminal key agreement problem with biometric or physical identifiers is considered. Two linear code constructions based on Wyner-Ziv coding are developed. The first construction uses random linear codes and achieves all points of…
We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an…
We present the idea of emergent qubits by an exact model construction on a trestle, also generalized to arbitrary graphs. The corresponding eigenstates are quantum paramagnetic, with free multipolar moments. We rigorously transform the…
We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…
Being dispersionless, flat bands on periodic lattices are solely characterized by their macroscopically degenerate eigenstates: compact localized states (CLSs) in real space and Bloch states in reciprocal space. Based on this property, this…
Deforming fundamental domains of wallpaper groups provides a systematic way to generate non-convex blocks which admit topological interlocking assemblies (TIAs). We use this approach to construct TIAs that fully occupy the space between two…
The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…
The well known Plotkin construction is, in the current paper, generalized and used to yield new families of Z2Z4-additive codes, whose length, dimension as well as minimum distance are studied. These new constructions enable us to obtain…
We study embeddings $J \rightarrow G$ of simple linear algebraic groups with the following property: the simple components of the $J$ module Lie($G$)/Lie($J$) are all minuscule representations of $J$. One family of examples occurs when the…
This paper investigates properties of realizations of linear or group codes on general graphs that lead to local reducibility. Trimness and properness are dual properties of constraint codes. A linear or group realization with a constraint…
In this paper, we present an algorithmic approach to design and construct planar truss structures based on symmetric lattices using modular elements. The method of assembly is similar to Leonardo grids as they both rely on the property of…
Mechanized verification of liveness properties for infinite programs with effects and nondeterminism is challenging. Existing temporal reasoning frameworks operate at the level of models such as traces and automata. Reasoning happens at a…