On the Nonasymptotic Bounds of Joint Source-Channel Coding with Hierarchical Sources
This work addresses a specific theoretical problem in information theory for researchers, focusing on hierarchical source structures, and appears incremental as it builds on existing bounds for a specialized setup.
The paper tackles the problem of deriving nonasymptotic bounds for joint source-channel coding with hierarchical sources, where both observable and unobservable sources must be reconstructed, and it presents achievable and converse bounds for the excess distortion probability in the finite blocklength regime.
In this paper we study the nonasymptotic bounds of a special Joint Source-Channel Coding system with hierarchical source, where an observable source and an unobservable indirect source are required to be reconstructed. Namely, we focus on the achievable and converse bounds of the excess distortion probability in the finite blocklength regime. The main challenge arises from the hierarchical source structure, which requires simultaneous reconstruction of both sources. This setup demands a coding scheme which satisfy the demand of encoding both source for the achievability bound, and a method to characterize the joint excess-distortion probability of two correlated events for the converse bound.