On the universality of the LZ-based decoding algorithm

Abstract

A universal decoder for a family of channels is a decoder that can be designed without prior knowledge of the particular channel in the family over which transmission takes place, and it yet attains the same random-coding error exponent as the optimal decoder tuned to the channel in use. We study Ziv's (1985) decoding algorithm, which is based on Lempel-Ziv (1978) incremental string parsing, and demonstrate that while it was originally proposed as a universal decoder for the family of finite-state channels with deterministic (but unknown) transitions, it is in fact universal for the broader class of all finite-state channels. We also demonstrate that the generalized likelihood decoder may not be universal even for finite families for which a universal decoder always exists.