On the Data Processing Theorem in the Semi–deterministic Setting

DOI10.1109/TIT.2014.2340450zbMATH Open1360.94443arXiv1304.0183OpenAlexW1965765268MaRDI QIDQ2986087

Neri Merhav

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Data processing lower bounds on the expected distortion are derived in the finite-alphabet semi-deterministic 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.

Full work available at URL: https://arxiv.org/abs/1304.0183

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (1)

Title not available (Why is that?)

This page was built for publication: On the Data Processing Theorem in the Semi–deterministic Setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986087)