Related papers: A Coding-Theoretic Application of Baranyai's Theor…
Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In…
It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…
We construct a new family of permutationally invariant codes that correct $t$ Pauli errors for any $t\ge 1$. We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction…
This paper presents a unified analysis framework that captures recent advances in the study of local-optimality characterizations for codes on graphs. These local-optimality characterizations are based on combinatorial structures embedded…
The Voronoi diagram is a certain geometric data structure which has numerous applications in various scientific and technological fields. The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and…
Decompositional theories describe the ways in which a global physical system can be split into subsystems, facilitating the study of how different possible partitions of a same system interplay, e.g. in terms of inclusions or signalling. In…
Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…
Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…
A new formalism is given for the renormalization of quantum field theories to all orders of perturbation theory, in which there are manifestly no overlapping divergences. We prove the BPH theorem in this formalism, and show how the local…
Topological subsystem codes were proposed by Bombin based on 3-face-colorable cubic graphs. Suchara, Bravyi and Terhal generalized this construction and proposed a method to construct topological subsystem codes using 3-valent hypergraphs…
Quantum replacer codes are codes that can be protected from errors induced by a given set of quantum replacer channels, an important class of quantum channels that includes the erasures of subsets of qubits that arise in quantum error…
We study finite-sum nonlinear programs with localized variable coupling encoded by a (hyper)graph. We introduce a graph-compliant decomposition framework that brings message passing into continuous optimization in a rigorous, implementable,…
Let $\binom{X}{h}$ be the collection of all $h$-subsets of an $n$-set $X\supseteq Y$. Given a coloring (partition) of a set $S\subseteq \binom{X}{h}$, we are interested in finding conditions under which this coloring is extendible to a…
Deciding if a given family of quantum states is topologically ordered is an important but nontrivial problem in condensed matter physics and quantum information theory. We derive necessary and sufficient conditions for a family of graph…
In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…
We introduce a simple initial working system in which relations (such as part-whole) are directly represented via an architecture with operating and learning rules fundamentally distinct from standard artificial neural network methods.…
Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general optimal solution, there is increasing demand for parametric…
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities. In this work, we propose a novel approach for the partitioning…
The classical family of Reed-Solomon codes consist of evaluations of polynomials over the finite field $\mathbb{F}_q$ of degree less than $k$, at $n$ distinct field elements. These are arguably the most widely used and studied codes, as…
Topological phases of noninteracting particles are distinguished by global properties of their band structure and eigenfunctions in momentum space. On the other hand, group theory as conventionally applied to solid-state physics focuses…