Title :
Enumeration of rare events, pyramid and ball cubic lattices
Author :
Krichevskii, R.E. ; Potapov, V.N.
Author_Institution :
Sobolev Inst. of Math., Novosibirsk, Russia
fDate :
29 Jun-4 Jul 1997
Abstract :
We give each binary word of length n with p ones, p/n→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
Keywords :
decoding; encoding; lattice theory; algorithms; ball cubic lattice; binary word; code; decoding speed; encoding; enumeration; pyramid cubic lattice; rare events; Decoding; Encoding; Entropy; Lattices; Mathematics; Vectors;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.612934
