This work deals with ways to accelerate the processing, concentrating on the decoding of Fibonacci encoded texts, by adapting a method originally suggested for the fast decoding of Huffman codes, which suffer from the same problem as the variable length Fibm codes. The method uses a set of partial decoding tables that are prepared in advance and depend only on the code, not on the actual text to be decoded, by means of which the decoding is then performed by blocks of k bits at a time, rather than bit per bit