We design an efficient algorithm for decoding canonical Huffman codes. The decoding is based on consequential look-up tables. We also present a data structure for reading bit sequences without using bit operations. Our algorithm, combined with this data structure allows fast byte-oriented decoding without causing high memory requirements.