2013/01/05 by Osvaldo Simeone, Simeone, Osvaldo
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Cooperative Communication and Network Coding #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1301.0926
openalex publication_date 2013/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The recently proposed set-up of source coding with a side information\n"vending machine" allows the decoder to select actions in order to control the\nquality of the side information. The actions can depend on the message received\nfrom the encoder and on the previously measured samples of the side\ninformation, and are cost constrained. Moreover, the final estimate of the\nsource by the decoder is a function of the encoder's message and depends\ncausally on the side information sequence. Previous work by Permuter and\nWeissman has characterized the rate-distortion-cost function in the special\ncase in which the source and the "vending machine" are memoryless. In this\nwork, motivated by the related channel coding model introduced by Kramer, the\nrate-distortion-cost function characterization is extended to a model with\nin-block memory. Various special cases are studied including block-feedforward\nand side information repeat request models.\n