A work-optimal O(log n logM) time PRAM-EREW algorithm for lossless image compression by block matching was shown in [1], where n is the size of the image and M is the maximum size of the match. The design of a parallel decoder was left as an open problem. By slightly modifying the parallel encoder, in this paper we show how to implement the decoder in O(log n logM) time with O(n/ log n) processors on the PRAM-EREW. With the realistic assumption that the size of the compressed image is O(n^1/2), the parallel decoder requires O(log2 n) time and O(n/ log n) processors on the mesh of trees.