.png){kind=icon}
.png){kind=icon}
Return
Dual-Domain Expurgated Error Exponents for Source Coding With Side Information
.png){kind=icon}
PRE
AI
DOI：10.1109/tit.2026.3668347.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce an expurgation method for source coding with side information that enables direct dual-domain derivations of expurgated error exponents. Dual-domain methods yield optimization problems over few parameters, with any sub-optimal choice resulting in an achievable exponent, as opposed to primal-domain optimization over distributions. In addition, dual-domain methods naturally allow for general alphabets and/or memory. We derive two such expurgated error exponents for different random-coding ensembles in the case where the decoder is possibly mismatched with respect to the source and side information joint distribution. We show the better of the exponents coincides with the Csisz & aacute;r-K & ouml;rner exponent obtained via a graph decomposition lemma. We show some numerical examples that illustrate the differences between the two exponents and show that in the case of source coding without side information, the expurgated exponent coincides with the error exponent of the source optimal code.
Keywords:
Decoding
Source coding
Measurement
Codes
Channel coding
Standards
Maximum likelihood decoding
Reliability
Optimization
Entropy
Source coding with side information
mismatched decoding
error exponents
expurgated error exponent
random code ensembles
Journal
I
IF:
2.9
Papers:
317
Citations:
0
View more organizations