Abstract

Multivalued encodings constitute an interesting generalization of ordinary encodings in that they allow each source symbol to be encoded by more than one codeword. In this paper we characterize the class of multivalued encodings that admit invariant decoders and provide an algorithm for constructing such decoders. Invariant decoders have the useful property that their behavior does not depend on the state in which they are, thus exhibiting optimal tolerance to accidental state transitions and/or errors in the input sequence.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call