On the number of 1-perfect binary codes: a lower bound
  We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight. 
Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia),   Sergey Avgustinovich (Sobolev Institute of Mathemati...