Abstract — We consider zero-delay or fixed finite-delay joint source channel coding of Markov sources using finite memory encoder and decoder. The objective is to choose designs that minimize expected total distortion over a finite horizon, expected discounted distortion over an infinite horizon and average distortion per unit time over an infinite horizon. The above problem is a dynamic team with non-classical information structure. We develop a sequential decomposition for this problem. The main contribution of this paper is to provide a systematic methodology for determination of optimal joint source-channel encoding-decoding strategies for zero-delay or fixed finite-delay point-to-point communication with limited memory. I
Vector quantization for joint source-channel coding over the finite-state Markov channel is studied....
We consider zero-delay single-user and multi-user source coding with average distortion constraint a...
This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-chan...
We consider zero-delay joint source-channel coding of individual source sequences for a general know...
Masters ThesisThe design of optimal joint source/channel coding and decoding is examined for dis ...
Abstract — Optimal zero-delay coding (quantization) of a finite-state Markov source is considered. B...
In zero-delay joint source-channel coding each source sample is mapped to a channel input, and the s...
Abstract—In zero-delay joint source-channel coding each source sample is mapped to a channel input, ...
Abstract — We consider a real--time communication system with noisy feedback consisting of a Markov ...
Abstract — Optimal zero-delay coding (quantization) of a vector-valued Markov source driven by a noi...
In this paper, we study the zero-delay source-channel coding problem, and specifically the problem o...
Abstract—This paper proposes an optimal maximum a poste-riori probability decoder for variable-lengt...
This paper shows new tight finite-blocklength bounds for the best achievable lossy joint source-chan...
Abstract — Traditionally, joint source-channel coding is viewed in the block coding context — all th...
Abstract—We study the optimal maximum likelihood (ML) block decoding of general binary codes sent ov...
Vector quantization for joint source-channel coding over the finite-state Markov channel is studied....
We consider zero-delay single-user and multi-user source coding with average distortion constraint a...
This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-chan...
We consider zero-delay joint source-channel coding of individual source sequences for a general know...
Masters ThesisThe design of optimal joint source/channel coding and decoding is examined for dis ...
Abstract — Optimal zero-delay coding (quantization) of a finite-state Markov source is considered. B...
In zero-delay joint source-channel coding each source sample is mapped to a channel input, and the s...
Abstract—In zero-delay joint source-channel coding each source sample is mapped to a channel input, ...
Abstract — We consider a real--time communication system with noisy feedback consisting of a Markov ...
Abstract — Optimal zero-delay coding (quantization) of a vector-valued Markov source driven by a noi...
In this paper, we study the zero-delay source-channel coding problem, and specifically the problem o...
Abstract—This paper proposes an optimal maximum a poste-riori probability decoder for variable-lengt...
This paper shows new tight finite-blocklength bounds for the best achievable lossy joint source-chan...
Abstract — Traditionally, joint source-channel coding is viewed in the block coding context — all th...
Abstract—We study the optimal maximum likelihood (ML) block decoding of general binary codes sent ov...
Vector quantization for joint source-channel coding over the finite-state Markov channel is studied....
We consider zero-delay single-user and multi-user source coding with average distortion constraint a...
This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-chan...