Enumeration of rare events, pyramid and ball cubic lattices
R.E. Krichevskii, Vladimir N. Potapov · 2002
We give each binary word of length n with p ones, p/n/spl rarr/0, a code whose length asymptotically by 1.56 bits per one exceeds the minimum. The encoding and decoding speed counted in operations over bits is maximal to within a constant factor. So, we trade length for speed. We present similar algorithms enumerating the pyramid and ball cubic lattices.