Abstract — Traditionally, joint source-channel coding is viewed in the block coding context — all the source symbols are known in advance by the encoder. Here, we consider source symbols to be revealed to the encoder in real time and require that they be reconstructed at the decoder within a certain fixed end-to-end delay. We derive upper and lower bounds on the reliability function with delay for cases with and without channel feedback. For erasure channels with feedback, the upper-bound is shown to be achievable and the resulting scheme shows that from a delay perspective, nearly separate source and channel coding is optimal. I
Supervisor: Gregory W. Wornell Title: Professor of Electrical Engineering and Computer ScienceThis ...
This paper shows new tight finite-blocklength bounds for the best achievable lossy joint source-chan...
This paper quantifies the fundamental limits of variable-length transmission of a general (possibly ...
In zero-delay joint source-channel coding each source sample is mapped to a channel input, and the s...
This paper quantifies the fundamental limits of variable-length transmission of a general (possibly ...
Joint source-channel coding has been developed with the motivation that it can achieve better perfor...
Joint source-channel coding has been developed with the motivation that it can achieve better perfor...
Abstract—In zero-delay joint source-channel coding each source sample is mapped to a channel input, ...
We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels ...
Abstract — We consider the problem of lossy source coding under a peak distortion measure in which s...
This thesis studies several problems in information theory where the notion of causality comes into ...
In this thesis, we consider error-correction codes for systems which have burst erasure channels, bu...
Abstract — In this paper, we study the upper and the lower bounds on the joint source-channel coding...
In this thesis, we consider error-correction codes for systems which have burst erasure channels, bu...
This paper studies expurgated random-coding bounds and error exponents for joint source-channel codi...
Supervisor: Gregory W. Wornell Title: Professor of Electrical Engineering and Computer ScienceThis ...
This paper shows new tight finite-blocklength bounds for the best achievable lossy joint source-chan...
This paper quantifies the fundamental limits of variable-length transmission of a general (possibly ...
In zero-delay joint source-channel coding each source sample is mapped to a channel input, and the s...
This paper quantifies the fundamental limits of variable-length transmission of a general (possibly ...
Joint source-channel coding has been developed with the motivation that it can achieve better perfor...
Joint source-channel coding has been developed with the motivation that it can achieve better perfor...
Abstract—In zero-delay joint source-channel coding each source sample is mapped to a channel input, ...
We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels ...
Abstract — We consider the problem of lossy source coding under a peak distortion measure in which s...
This thesis studies several problems in information theory where the notion of causality comes into ...
In this thesis, we consider error-correction codes for systems which have burst erasure channels, bu...
Abstract — In this paper, we study the upper and the lower bounds on the joint source-channel coding...
In this thesis, we consider error-correction codes for systems which have burst erasure channels, bu...
This paper studies expurgated random-coding bounds and error exponents for joint source-channel codi...
Supervisor: Gregory W. Wornell Title: Professor of Electrical Engineering and Computer ScienceThis ...
This paper shows new tight finite-blocklength bounds for the best achievable lossy joint source-chan...
This paper quantifies the fundamental limits of variable-length transmission of a general (possibly ...