3 citations · 3 across the 3 of their papers we have counts for
4 papers
On Nearly-Perfect Covering Codes Beyond Radius One
Gabriel Sac Himelfarb, Moshe Schwartz
We study (binary) nearly-perfect covering codes, which are codes that attain the Van Wee bound with equality. They act as the covering counterparts to nearly-perfect error-correcti…
On the burst-covering radius of binary cyclic codes
Gabriel Sac Himelfarb, Moshe Schwartz
We define and study burst-covering codes. We provide some general bounds connecting the parameters of a code with its burst-covering radius. We then provide stronger bounds on the…
Improved Constructions of Skew-Tolerant Gray Codes
Gabriel Sac Himelfarb, Moshe Schwartz
We study skew-tolerant Gray codes, which are Gray codes in which changes in consecutive codewords occur in adjacent positions. We present the first construction of asymptotically n…
A construction of a - Poisson generic sequence
Verónica Becher, Gabriel Sac Himelfarb
Years ago Zeev Rudnick defined the -Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the init…