2021/07/19 by Neri Merhav, Merhav, Neri
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Cellular Automata and Applications #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.2107.08778
openalex publication_date 2021/07/19 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
We study the following semi-deterministic setting of the joint source-channel\ncoding problem: a deterministic source sequence (a.k.a. individual sequence) is\ntransmitted via a memoryless channel, using delay-limited encoder and decoder,\nwhich are both implementable by periodically-varying finite-state machines, and\nthe decoder is granted with access to side information, which is a noisy\nversion of the source sequence. We first derive a lower bound on the achievable\nexpected distortion in terms of the empirical statistics of the source\nsequence, the number of states of the encoder, the number of states of the\ndecoder, their period, and the overall delay. The bound is shown to be\nasymptotically achievable by universal block codes in the limit of long blocks.\nWe also derive a lower bound to the best achievable excess--distortion\nprobability and discuss situations where it is achievable. Here, of course,\nsource coding and channel coding cannot be completely separated without loss of\noptimality. Finally, we outline a few extensions of the model considered, such\nas: (i) incorporating a common reconstruction constraint, (ii) availability of\nside information at both ends, and (iii) extension to the Shannon channel with\ncausal state information at the encoder. This work both extends and improves on\nearlier work of the same flavor (Ziv 1980, Merhav 2014), which focused only on\nthe expected distortion, without side information at either end, and without\nthe above mentioned additional ingredients.\n