
The paper establishes single-letter lower and upper bounds on the common randomness (CR) capacity for a two-source model involving correlated arbitrary sources with infinite Polish alphabets, assisted by one-way communication over noisy memoryless channels.


coremsg

capacity-bounds-for-common-randomness-generation-from-sources-with-infinite-polish-alphabet-over-noisy-memoryless-channels


Capacity Bounds for Common Randomness Generation from Sources with Infinite Polish Alphabet over Noisy Memoryless Channels
