Related papers: Multiply Constant-Weight Codes and the Reliability…
A Physical unclonable functions (PUF), alike a fingerprint, exploits manufacturing randomness to endow each physical item with a unique identifier. One primary PUF application is the secure derivation of volatile cryptographic keys using a…
Function-Correcting Codes (FCCs) are a novel class of codes designed to protect function evaluations of messages against errors while minimizing redundancy. A theoretical framework for systematic FCCs to channels matched to the Lee metric…
We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) that extends intuitionistic logic by least and greatest…
In this work we study different classes of effective composite metrics proposed in the context of one-loop quantum corrections in bimetric gravity. For this purpose we consider contributions of the matter loops in form of cosmological…
We introduce a class of stochastic processes with reinforcement consisting of a sequence of random partitions $\{\mathcal{P}_t\}_{t \ge 1}$, where $\mathcal{P}_t$ is a partition of $\{1,2,\dots, Rt\}$. At each time~$t$,~$R$ numbers are…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
We consider a definition of the QCD running coupling constant $\alpha(\mu)$ related to Wilson loops of size $r{\times}t$ with arbitrary fixed $t/r$. The schemes defined by these couplings are very close to the $\overline{\rm MS}$ scheme…
A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multi-type branching processes, stochastic context-free grammars,…
Tailored topological stabilizer codes in two dimensions have been shown to exhibit high storage threshold error rates and improved subthreshold performance under biased Pauli noise. Three-dimensional (3D) topological codes can allow for…
Given a constant weight linear code, we investigate its weight hierarchy and the Stanley-Reisner resolution of its associated matroid regarded as a simplicial complex. We also exhibit conditions on the higher weights sufficient to conclude…
A new symmetry-preserving loop regularization method proposed in \cite{ylw} is further investigated. It is found that its prescription can be understood by introducing a regulating distribution function to the proper-time formalism of…
We study a class of gauge fixings of the Bacon-Shor code at the circuit level, which includes a subfamily of generalized surface codes. We show that for these codes, fault tolerance can be achieved by direct measurements of the stabilizers.…
In this paper, we introduce the gauge-fixed QLDPC surgery scheme, an improved logical measurement scheme based on the construction of Cohen et al. (Sci. Adv. 8, eabn1717). Our scheme leverages expansion properties of the Tanner graph to…
We address the recently suggested problem of causal lossless coding of a randomly arriving source samples. We construct variable-to-fixed coding schemes and show that they outperform the previously considered fixed-to-variable schemes when…
We investigate the coboundary expansion property of tensor product codes, known as product expansion, which plays an important role in recent constructions of good quantum LDPC codes and classical locally testable codes. Prior research has…
We extend conformal prediction methodology beyond the case of exchangeable data. In particular, we show that a weighted version of conformal prediction can be used to compute distribution-free prediction intervals for problems in which the…
The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binary…
We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group,…
We used the mark weighted correlation functions (MCFs), $W(s)$, to study the large scale structure of the Universe. We studied five types of MCFs with the weighting scheme $\rho^\alpha$, where $\rho$ is the local density, and $\alpha$ is…
We investigate the asymptotic number of equivalence classes of linear codes with prescribed length and dimension. While the total number of inequivalent codes of a given length has been studied previously, the case where the dimension…