Searcharxiv⌕ Search

arXiv subjects

Isaac Barouch Essayag

Publications and source records attributed to Isaac Barouch Essayag.

9 recordsLinked to original sources

Faster Deterministic All-Pairs Shortest Paths with Real Edge Weights

We give a deterministic algorithm for all-pairs shortest paths in directed $n$-vertex graphs with arbitrary finite real edge weights and no negative cycles. It computes all distances in $O(n^{2.9929729})$ worst-case time, improving both the recent deterministic bound $O(n^{2.9997})$ and the Las Vegas expected-time bound $O(n^{2.993805})$. We use a model with exact real addition, subtraction and comparison at unit cost; auxiliary integer arithmetic and indexed memory access are charged at bit cost.

cs.DS↗

Multiset Deletion Codes: Cyclic Syndrome Constructions, Bounds, and Exact Results

We determine sharp class-size estimates for multiset codes over $q$ symbols that correct up to $t$ deletions. For fixed $q,t\ge2$, we prove that the syndrome classes defined by Nathanson's geometric-sum labels modulo $M=1+t+\cdots+t^{q-1}$ differ from their average size by $O(n^{q/p-1})$, where $n$ is the blocklength and $p$ is the least prime divisor of $q$. This exponent is sharp, and every prescribed class has size asymptotic to the average. For prime $q$, all classes have equal size when $n\equiv-1,\ldots,-(q-1)\pmod M$. We also present our radix construction, whose labels are zero and the first $q-1$ powers of $t+1$, starting at $1$, modulo $t(t+1)^{q-2}+1$. We determine its sharp class-size deviation exponent. For even $q\ge4$, its syndrome classes have a smaller deviation exponent, although their average size is smaller. Over four symbols and every $t\ge2$, we show that the radix labels still correct up to $t$ deletions modulo a reduced modulus, which gives bounded deviations and eventually larger classes than either unmodified construction. For a fixed number $k\ge2$ of surviving symbols, we prove that some maximum code contains all constant words, reducing the remaining optimization to multisets with multiplicities below $k$. Finally, for one deletion at length four over $q\ge4$ symbols, we show that the best bound from fractional weights on deletion outputs, rounded down, equals the maximum code size exactly when $q\equiv2,4\pmod6$.

cs.IT↗

Quantum Leakage from Shamir Sharing with Correlated Resources

We bound local quantum leakage from Shamir sharing uniformly over prime fields and permitted share-dependent channels. The adversary receives all outputs and a reference to a resource independent of the secret and sharing randomness. For independent device-reference pairs at fixed output dimension, we determine the exact exponent of the worst-case trace distance for two chosen secrets at every fixed reconstruction rate above one half, including its dependence on entanglement within each pair. For unentangled one-qubit leakage, this improves the sufficient rate of about $0.7334$ proved by Batra et al. Above one half, we also determine the exact exponent when an arbitrarily entangled support is tensored with single-device states elsewhere. Every fixed support fraction below the reconstruction rate gives exponential security, while a reconstruction set admits a known attack. Exponential security extends to fixed finite-memory processes with primitive transfer channels, fixed stationary chains satisfying upper operator mixing, and canonical primitive matrix product states, allowing arbitrary finite adversary extensions of the device marginal. For one-qubit outputs, fully separable resources and independent pairs whose joint output-reference states are positive under partial transpose for every share admit rates slightly below one half.

quant-ph↗

From Round-Trip State Echo to Error Recovery: Snapshot-Resolved Quantum-Hardware Diagnostics

We examine which conclusions from quantum-hardware benchmarks persist when the same programs are run again. On eight fixed routes of IQM Emerald, round-trip state echo (RTSE), a diagnostic of state return after a round trip, gave mean scores near $0.84$ that differed by only $0.00125$ between two executions. Individual route estimates nevertheless changed by up to $0.06$ in both directions. The mean difference between RTSE and measurement-free teleportation along the same routes shrank from $0.046$ to $0.014$ and was no longer statistically resolved on repetition; none of the four prespecified communication targets met its replication rule. Recovery with an existing four-qubit single-deletion code also changed on repetition: after discarding one encoded qubit in the circuit model, the IQM mean fell from $0.738$ to $0.624$ and failed the replication test against the two-thirds operational reference. In a separate IonQ experiment, recovery means of $0.91$ and $0.92$ passed tests against that reference and against a deliberately incorrect decoder in both executions. These results concern the tested workloads and executions. They show why a nearly unchanged aggregate benchmark score needs to be interpreted alongside individual routes, direct task comparisons, and repeated executions.

quant-ph↗

Exact value and rigidity of the $2\times3$ magic rectangle

The $2\times3$ magic rectangle is a nonlocal game in which two players match entries subject to incompatible parity constraints. Its quantum value was suggested by numerical bounds and known quantum random access codes. We prove that this value is $(1+\sqrt{2/3})/2$ and classify all optimal strategies in arbitrary finite local dimensions, allowing general measurements: up to local isometries and ancillary systems, each contains a maximally entangled pair of four-dimensional systems with fixed measurements on the local state supports. The same value holds for commuting-operator strategies and for the almost-quantum relaxation, confirming the Adamson--Wallden conjecture for this rectangle. For finite-dimensional magic-square strategies, the largest score compatible with perfect prediction of Alice's complete first row by an adversary with quantum side information is one third plus two thirds of the rectangle value. We classify the strategies attaining this threshold with perfect prediction and give linear-order upper and lower bounds on one minus the best compatible guessing probability above it. The rectangle value is also the optimal average success probability of finite-dimensional three-bit random access codes that hide the full input parity, and we classify all optimal codes.

quant-ph↗

The Exact Second Generalized Covering Radius of Binary Primitive Triple-Error-Correcting BCH Codes

Let $C_m:=\mathrm{BCH}(3,m)$ be the binary primitive triple-error-correcting BCH code of length $2^m-1$. We determine its second generalized covering radius exactly: $R_2(C_m)=8$ for every $m\geq5$. Equivalently, every two-dimensional syndrome subspace is contained in the binary span of at most eight parity-check columns, and eight columns are necessary in the worst case. This matches the known lower bound.

cs.IT↗

Auxiliary Codes and the Generalized Packing-Covering Conjecture

The generalized packing--covering conjecture asks whether, at every order, the packing radius of a linear code is at most its covering radius. We prove the conjecture for every linear code of redundancy at most fourteen over every finite field, extending the previously established range of redundancies at most seven. We also prove the bound on generalized Hamming weights $d_t(C)\le2R_t(C)+1$ whenever the alphabet size $q$ satisfies $q\ge R_t(C)$. Both results use an auxiliary-code criterion that converts a covering property in the syndrome space into a weight bound. For binary primitive BCH codes, the packing radius is strictly smaller than the covering radius for every fixed error parameter and order, both at least two, once the extension degree is sufficiently large; this follows from existing covering bounds.

cs.IT↗

Polynomial Constructions and Deletion-Ball Geometry for Multiset Deletion Codes

We study error-correcting codes in the space $\mathcal{S}_{n,q}$ of length-$n$ multisets over a $q$-ary alphabet under the deletion metric, motivated by permutation channels in which ordering is completely lost and errors act only on symbol multiplicities. We develop two complementary directions. First, we present polynomial Sidon-type constructions over finite fields, in both projective and affine forms, yielding multiset $t$-deletion-correcting codes in the regime $t<q$ with redundancy $t+O(1)$, independent of the blocklength $n$. Second, we develop a geometric analysis of deletion balls in $\mathcal{S}_{n,q}$. Using difference-vector representations together with a diagonal reduction of the relevant generating functions, we derive exact generating-function expressions for individual deletion-ball sizes, exact formulas for the number of ordered pairs of multisets at a fixed distance $m$, and consequently for the average ball size. We prove that radius-$r$ deletion balls are minimized at extreme multisets and maximized at the most balanced multisets, giving a formal global characterization of extremal centers in $\mathcal{S}_{n,q}$. We further relate the maximal-ball value to the ideal difference set $S_{q-1}(r,r)$ through boundary truncation, obtaining explicit closed forms for $q=2$ and $q=3$. These geometric results lead to volume-based bounds on code size, including sphere-packing upper bounds, a boundary-aware analysis of code--anticode arguments, and Gilbert--Varshamov-type lower bounds governed by exact average ball sizes. For fixed $q$ and $t$, the resulting average-ball lower bound matches the interior-difference-set scale asymptotically.

cs.IT↗

Optimal Functional $2^{s-1}$-Batch Codes: Exploring New Sufficient Conditions

A functional $k$-batch code of dimension $s$ consists of $n$ servers storing linear combinations of $s$ linearly independent information bits. These codes are designed to recover any multiset of $k$ requests, each being a linear combination of the information bits, by $k$ disjoint subsets of servers. A recent conjecture suggests that for any set of $k = 2^{s-1}$ requests, the optimal solution requires $2^s-1$ servers. This paper shows that the problem of functional $k$-batch codes is equivalent to several other problems. Using these equivalences, we derive sufficient conditions that improve understanding of the problem and enhance the ability to find the optimal solution.

cs.IT↗