Related papers: On the Locality of Codeword Symbols in Non-Linear …
This manuscript introduces various notions of k-locality of stabilizer codes inherited from the associated stabilizer groups. A choice of generators for the group leads to a Hamiltonian with the code in its groundspace, while a Hamiltonian…
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…
Hardy's non-locality theorem for multiple two-level systems is explored in the context of generalized nonlocal theory. We find nonlocal but non-signaling probabilities, providing Hardy's nonlocal argument, which are higher than those in…
In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…
The cover metric is suitable for describing the resilience against correlated errors in arrays, in particular crisscross errors, which makes it interesting for applications such as distributed data storage (DDS). In this work, we consider…
Linear codes for error detection on a q-ary symmetric channel are studied. It is shown that for given dimension k and minimum distance d, there exists a value \mu(d,k) such that if C is a code of length n >= \mu(d,k), then neither C nor its…
Strong quantum nonlocality was introduced recently as a stronger manifestation of nonlocality in multipartite systems through the notion of local irreducibility in all bipartitions. Known existence results for sets of strongly nonlocal…
The current framework of network utility maximization for distributed rate allocation assumes fixed channel code rates. However, by adapting the physical layer channel coding, different rate-reliability tradeoffs can be achieved on each…
We present a new combinatorial characterization for local optimality of a codeword in an irregular Tanner code. The main novelty in this characterization is that it is based on a linear combination of subtrees in the computation trees.…
We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…
We propose a fresh take on understanding the mechanisms of neural networks by analyzing the rich directional structure of optimization trajectories, represented by their pointwise parameters. Towards this end, we introduce some natural…
We study non-linear functionals, including quasi-linear functionals, p-conic quasi-linear functionals, d-functionals, r-functionals, and their relationships to deficient topological measures and topological measures on locally compact…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of weight distribution that captures the code's locality. Using a…
Consider the problem of computing quantized linear functions with only a few queries. Formally, given $\mathbf{x}\in \mathbb{R}^k$, our goal is to encode $\mathbf{x}$ as $\mathbf{c} \in \mathbb{R}^n$, for $n > k$, so that for any…
Making use of the Quantum Network formalism of \textit{Phys. Rev. A,} \textbf{82} (2010) 062305, we present the case for quantum networks with finite outcomes, more specifically one which could distinguish only between specific unitary…
In this work, we continue the search for quantum locally testable codes (qLTCs) of new parameters by presenting three constructions that can make new qLTCs from old. The first analyses the soundness of a quantum code under Hastings' weight…
The effect of non-locality in the NN interaction with an off-energy shell character has been studied in the past in relation with the possibility that some models could be approximately phase-shifts equivalent. This work is extended to a…
Based on ideas of K\"otter and Kschischang we use constant dimension subspaces as codewords in a network. We show a connection to the theory of q-analogues of a combinatorial designs, which has been studied in Braun, Kerber and Laue as a…
In an $[n,k,d]$ linear code, a code symbol is said to have locality $r$ if it can be repaired by accessing at most $r$ other code symbols. For an $(n,k,r)$ \emph{locally repairable code} (LRC), the minimum distance satisfies the well-known…