2 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
10 papers · 1 filter
Binary Multiple-Node-Erasure-Correcting Codes over Complete Graphs: Constructions, q-Ary Metric Balls, and Duality
Aryeh Lev Zabokritskiy
We study linear codes whose coordinates are the ordinary edges and self-loops of complete undirected graphs; a node erasure removes all coordinates incident with a failed vertex. T…
Coding for Multiple Reverse-Complement and Palindromic Duplications
Aryeh Lev Zabokritskiy
Reverse-complement (RC) and palindromic (PAL) duplications copy a length- block, reverse the copy, and insert it immediately after the original block; an RC duplication also com…
Quantitative Tiling Stability From Quadratic Discrepancy In Hamming Spaces
Valery, Grishin, Aryeh Lev Zabokritskiy
Quadratic ball discrepancy measures how uniformly a code meets Hamming balls over all centers and radii. Perfect codes minimize this quantity among codes of the same cardinality. W…
Asymptotically Tight Bounds for Generalized Covering Radii of Binary Primitive BCH Codes at All Higher Orders
Zeev Vladimir Belinsky, Aryeh Lev Zabokritskiy
We study the generalized covering radii of binary primitive BCH codes, which measure how many parity-check columns suffice to span several prescribed syndromes. For the four-error-…
The Exact Second Generalized Covering Radius of Binary Primitive Triple-Error-Correcting BCH Codes
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
Let be the binary primitive triple-error-correcting BCH code of length . We determine its second generalized covering radius exactly: f…
Perfect Codes As Exact Minimizers Of Quadratic Discrepancy In q-ary Hamming Spaces
Aryeh Lev Zabokritskiy
Total quadratic ball discrepancy measures the deviation of codeword counts from uniformity over all Hamming balls. We prove that, whenever a Hamming space and cardinality admit a p…
Extinction Depth and q-ary Error-Correcting Codes for the Limited Permutation Channel
Noam Ben Shimon, Aryeh Lev Zabokritskiy
In the radius-one limited permutation channel, errors consist of disjoint adjacent transpositions. A correcting code must separate distinct codewords: their error balls may not con…
A -ary Local Criterion for the Radius-One Limited Permutation Channel and Almost-Optimal Binary Block-Concatenation Codes
Noam Ben Shimon, Aryeh Lev Zabokritskiy
The radius-one limited permutation channel maps a transmitted word to any word obtained by an arbitrary set of pairwise disjoint adjacent transposi…
Polynomial Constructions and Deletion-Ball Geometry for Multiset Deletion Codes
Avraham Kreindel, Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
We study error-correcting codes in the space of length- multisets over a -ary alphabet under the deletion metric, motivated by permutation channels in whi…
Multiset Deletion Codes: Cyclic Constructions, Bounds, and Exact Results
Avraham Kreindel, Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
We study deletion-correcting codes in the space of length- multisets over a -ary alphabet. We present an explicit cyclic Sidon-type construction for arbitrary alphabet size $…