Upper Bound on Error Exponents with Delay for Lossless Source Coding with Side-Information

2006 ◽  
Author(s):  
Cheng Chang ◽  
Anant Sahai
Keyword(s):  
Upper Bound ◽  
Source Coding ◽  
Side Information ◽  
Error Exponents

An upper bound on the rate distortion function for source coding with partial side information at the decoder

1979 ◽  
Vol 25 (6) ◽  
pp. 664-666 ◽  
Author(s):  
T. Berger ◽  
K. Housewright ◽  
J. Omura ◽  
Suiyin Yung ◽  
J. Wolfowitz
Keyword(s):  
Upper Bound ◽  
Source Coding ◽  
Side Information ◽  
Rate Distortion ◽  
Distortion Function

scholarly journals Trade-offs between Error Exponents and Excess-Rate Exponents of Typical Slepian–Wolf Codes

Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 265
Author(s):  
Ran Tamir (Averbuch) ◽  
Neri Merhav
Keyword(s):  
Source Coding ◽  
Side Information ◽  
Rate Function ◽  
Error Exponent ◽  
Error Exponents ◽  
Trade Offs ◽  
Special Cases ◽  
Correlated Information ◽  
Random Codes ◽  
Random Binning

Typical random codes (TRCs) in a communication scenario of source coding with side information in the decoder is the main subject of this work. We study the semi-deterministic code ensemble, which is a certain variant of the ordinary random binning code ensemble. In this code ensemble, the relatively small type classes of the source are deterministically partitioned into the available bins in a one-to-one manner. As a consequence, the error probability decreases dramatically. The random binning error exponent and the error exponent of the TRCs are derived and proved to be equal to one another in a few important special cases. We show that the performance under optimal decoding can be attained also by certain universal decoders, e.g., the stochastic likelihood decoder with an empirical entropy metric. Moreover, we discuss the trade-offs between the error exponent and the excess-rate exponent for the typical random semi-deterministic code and characterize its optimal rate function. We show that for any pair of correlated information sources, both error and excess-rate probabilities exponential vanish when the blocklength tends to infinity.

Secure source coding with action-dependent side information

2011 ◽  
Author(s):  
Kittipong Kittichokechai ◽  
Tobias J. Oechtering ◽  
Mikael Skoglund
Keyword(s):  
Source Coding ◽  
Side Information

scholarly journals Channel Coding and Source Coding With Increased Partial Side Information

Entropy ◽  
2017 ◽  
Vol 19 (9) ◽  
pp. 467
Author(s):  
Avihay Sadeh-Shirazi ◽  
Uria Basher ◽  
Haim Permuter
Keyword(s):  
Channel Coding ◽  
Source Coding ◽  
Side Information

Source coding theorem and its converse with side information

1979 ◽  
Vol 17 (3) ◽  
pp. 169-176
Author(s):  
Bhu Dev Sharma ◽  
Ved Priya
Keyword(s):  
Source Coding ◽  
Side Information

Source coding with side information for binary memoryless sources

2019 ◽  
Author(s):  
Irina E. Bocharova ◽  
Boris D. Kudryashov
Keyword(s):  
Source Coding ◽  
Side Information
Sign in / Sign up

Export Citation Format

Share Document