English
Related papers

Related papers: On Optimal Causal Coding of Partially Observed Mar…

200 papers

We consider the situation in which a continuous-time vector Gauss-Markov process is observed through a vector Gaussian channel (sensor) and estimated by the Kalman-Bucy filter. Unlike in standard filtering problems where a sensor model is…

Optimization and Control · Mathematics 2017-09-12 Takashi Tanaka , Mikael Skoglund , Valeri Ugrinovskii

Starting from the Avellaneda-Stoikov framework, we consider a market maker who wants to optimally set bid/ask quotes over a finite time horizon, to maximize her expected utility. The intensities of the orders she receives depend not only on…

Trading and Market Microstructure · Quantitative Finance 2020-06-29 Diego Zabaljauregui , Luciano Campi

We consider an infinite horizon optimal control problem for a continuous-time Markov chain $X$ in a finite set $I$ with noise-free partial observation. The observation process is defined as $Y_t = h(X_t)$, $t \geq 0$, where $h$ is a given…

Optimization and Control · Mathematics 2018-06-04 Alessandro Calvia

Motivated by video coding applications, the problem of sequential coding of correlated sources with encoding and/or decoding frame-delays is studied. The fundamental tradeoffs between individual frame rates, individual frame distortions,…

Information Theory · Computer Science 2008-09-30 Nan Ma , Ye Wang , Prakash Ishwar

A new model for controlled sensing for multihypothesis testing is proposed and studied in the sequential setting. This new model, termed {\em controlled Markovian observation} model, exhibits a more complicated memory structure in the…

Optimization and Control · Mathematics 2014-07-01 Sirin Nitinawarat , Venupogal V. Veeravalli

In this paper, we propose a coding scheme based on polar codes for empirical coordination of autonomous devices. We consider a two-node network with a noisy link in which the input and output signals have to be coordinated with the source…

Information Theory · Computer Science 2018-02-28 Giulia Cervia , Laura Luzzi , Maël Le Treust , Matthieu R. Bloch

In this paper, distributed (or multiterminal) source coding with one distortion criterion and correlated messages is considered. This problem can be also called ``Berger-Yeung problem with correlated messages''. It corresponds to the source…

Information Theory · Computer Science 2009-08-18 Suhan Choi

The problem of state communication over a discrete memoryless channel with discrete memoryless state is studied when the state information is available strictly causally at the encoder. It is shown that block Markov encoding, in which the…

Information Theory · Computer Science 2015-03-20 Chiranjib Choudhuri , Young-Han Kim , Urbashi Mitra

Source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information and the source, instead of being given and fixed as in the classical Wyner-Ziv…

Information Theory · Computer Science 2013-02-11 Behzad Ahmadi , Osvaldo Simeone

-We develop a polar coding scheme for empirical coordination in a two-node network with a noisy link in which the input and output signals have to be coordinated with the source and the reconstruction. In the case of non-causal encoding and…

Information Theory · Computer Science 2016-09-22 Giulia Cervia , Laura Luzzi , Matthieu Bloch , Maël Le Treust

The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder---to whom the side information is unavailable---be able to compute the decoder's reconstruction sequence to within some…

Information Theory · Computer Science 2016-11-15 Amos Lapidoth , Andreas Malär , Michèle Wigger

An enhanced covering lemma for a Markov chain is proved in this paper, and then the distributed source coding problem of correlated general sources with one average distortion criterion under fixed-length coding is investigated. Based on…

Information Theory · Computer Science 2016-11-17 Shengtian Yang , Peiliang Qiu

Motivated by wide-ranging applications such as video delivery over networks using Multiple Description Codes, congestion control, and inventory management, we study the state-tracking of a Markovian random process with a known transition…

Information Theory · Computer Science 2017-03-06 Parisa Mansourifard , Tara Javidi , Bhaskar Krishnamachari

We derive the second order rates of joint source-channel coding, whose source obeys an irreducible and ergodic Markov process when the channel is a discrete memoryless, while a previous study solved it only in a special case. We also…

Information Theory · Computer Science 2024-09-10 Ryo Yaguchi , Masahito Hayashi

In multi-terminal networks, feedback increases the capacity region and helps communication devices to coordinate. In this article, we deepen the relationship between coordination and feedback by considering a point-to-point scenario with an…

Information Theory · Computer Science 2016-11-15 Maël Le Treust

In the classical lossy source coding problem, one encodes long blocks of source symbols that enables the distortion to approach the ultimate Shannon limit. Such a block-coding approach introduces large delays, which is undesirable in many…

Information Theory · Computer Science 2024-06-18 Liam Cregg , Tamas Linder , Serdar Yuksel

Motivated by the question of whether the recently introduced Reduced Cutset Coding (RCC) offers rate-complexity performance benefits over conventional context-based conditional coding for sources with two-dimensional Markov structure, this…

Information Theory · Computer Science 2017-02-28 Matthew G. Reyes , David L. Neuhoff

For memoryless sources, delayed side information at the decoder does not improve the rate-distortion function. However, this is not the case for more general sources with memory, as demonstrated by a number of works focusing on the special…

Information Theory · Computer Science 2012-07-19 Osvaldo Simeone , Haim H. Permuter

We consider a real-time communication system with noisy feedback consisting of a Markov source, a forward and a backward discrete memoryless channels, and a receiver with finite memory. The objective is to design an optimal communication…

Information Theory · Computer Science 2007-09-25 Aditya Mahajan , Demosthenis Teneketzis

We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…

Information Theory · Computer Science 2021-09-29 Neri Merhav