One Shot Joint Source Channel Coding

Nir Elkayam, Meir Feder

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents a one shot analysis to the lossless joint source channel coding problem. Achievable and converse bounds are derived. Both bound are given in term of F(z), the CDF of the random variable Z=-log pe(V, X, Y) where pe(V, X, Y) is the the pairwise error probability between two codewords associated with two source symbols. This is an information functional that resembles a similar quantity in the meta-converse form of one shot channel coding, but it depends also on the source V in addition to the input X and the output Y of the channel. The role of F(z) is analogous to the role of the information spectrum, but our treatment does not include any asymptotic analysis. Relation to other known bounds is also demonstrated.

Original languageEnglish
Title of host publication2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages623-628
Number of pages6
ISBN (Electronic)9798350382846
DOIs
StatePublished - 2024
Event2024 IEEE International Symposium on Information Theory, ISIT 2024 - Athens, Greece
Duration: 7 Jul 202412 Jul 2024

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2024 IEEE International Symposium on Information Theory, ISIT 2024
Country/TerritoryGreece
CityAthens
Period7/07/2412/07/24

Funding

FundersFunder number
Israel Science Foundation819/20

    Fingerprint

    Dive into the research topics of 'One Shot Joint Source Channel Coding'. Together they form a unique fingerprint.

    Cite this