3 citations · 3 across the 1 of their papers we have counts for
4 papers
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…
Quantum Error Detection II: Bounds
A. Ashikhmin, A. Barg, E. Knill +1
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower…
Quantum Error Detection I: Statement of the Problem
Alexei Ashikhmin, Alexander Barg, Emanuel Knill +1
I. This paper is devoted to the problem of error detection with quantum codes. In the first part we examine possible problem settings for quantum error detection. Our goal is to de…
On binary constructions of quantum codes
Gérard Cohen, Sylvia Encheva, Simon Litsyn
Using the notion of generalized weight we improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families…