442 citations · 1.8k across the 59 of their papers we have counts for
4 papers · 1 filter
Optimal Tristance Anticodes in Certain Graphs
Tuvi Etzion, Moshe Schwartz, Alexander Vardy
For , the \emph{tristance} is a generalization of the -distance on to a quantity that reflects the relative dispersion of three…
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Venkatesan Guruswami, Alexander Vardy
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear code…
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes
Tao Jiang, Alexander Vardy
Given positive integers and , let denote the maximum size of a binary code of length and minimum distance . The well-known Gilbert-Varshamov bound asserts…
A Lower Bound on the Density of Sphere Packings via Graph Theory
Michael Krivelevich, Simon Litsyn, Alexander Vardy
Using graph-theoretic methods we give a new proof that for all sufficiently large , there exist sphere packings in of density at least , exceeding the classical…