Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 60, Issue 10, Pages 6032-6040Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2014.2340450
Keywords
Data processing theorem; finite-state machine; Lempel-Ziv algorithm; redundancy; delay; common reconstruction
Ask authors/readers for more resources
Data processing lower bounds on the expected distortion are derived in the finite-alphabet semideterministic setting, where the source produces a deterministic, individual sequence, but the channel model is probabilistic, and the decoder is subjected to various kinds of limitations, e. g., decoders implementable by finite-state machines, with or without counters, and with or without a restriction of common reconstruction with high probability. Some of our bounds are given in terms of the Lempel-Ziv complexity of the source sequence or the reproduction sequence. We also demonstrate how some analogous results can be obtained for classes of linear encoders and linear decoders in the continuous alphabet case.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available