Related papers: A Singleton Bound for Lattice Schemes
Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…
Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…
Protein folds are highly designable, in the sense that many sequences fold to the same conformation. In the present work we derive an expression for the designability in a 20 letter lattice model of proteins which, relying only on the…
For an arbitrary (3,L) QC-LDPC code with a girth of twelve, a tight lower bound of the consecutive lengths is proposed. For an arbitrary length above the bound the resultant code necessarily has a girth of twelve, and for the length meeting…
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…
We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal…
We develop the idea that a natural link between Boltzmann schemes and finite volumes exists naturally: the conserved mass and momentum during the collision phase of the Boltzmann scheme induces general expressions for mass and momentum…
Most bounds on the size of codes hold for any code, whether linear or nonlinear. Notably, the Griesmer bound, holds only in the linear case. In this paper we characterize a family of systematic nonlinear codes for which the Griesmer bound…
We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…
In materials science, wedge disclinations are defects caused by angular mismatches in the crystallographic lattice. To describe such disclinations, we introduce an atomistic model in planar domains. This model is given by a…
Motivated by applications in DNA-based storage, we study explicit encoding and decoding schemes of binary strings satisfying locally balanced constraints, where the $(\ell,\delta)$-locally balanced constraint requires that the weight of any…
The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds…
We give the Bacon-Shor code a threshold purely by deleting gates from its circuit. Specifically: we use lattice surgery to concatenate the Bacon-Shor code with itself using local planar connectivity, and observe that the resulting circuit…
For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…
On the study of protein folding, our understanding about the protein structures is limited. In this paper we find one way to characterize the compact structures of lattice protein model. A quantity called Partnum is given to each compact…
PhD Thesis--A compilation of the papers: "Lower Bounds for Identifying Codes in Some Infinite Grids", "Improved Bounds for r-identifying Codes of the Hex Grid", and "Vertex Identifying Codes for the n-dimensional Lattics" along with some…
In this paper we investigate bounds on rate and minimum distance of codes with $t$ availability. We present bounds on minimum distance of a code with $t$ availability that are tighter than existing bounds. For bounds on rate of a code with…
Higher symmetries can emerge at low energies in a topologically ordered state with no symmetry, when some topological excitations have very high energy scales while other topological excitations have low energies. The low energy properties…