期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 60, 期 10, 页码 6032-6040出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2014.2340450
关键词
Data processing theorem; finite-state machine; Lempel-Ziv algorithm; redundancy; delay; common reconstruction
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据