2 citations · 2 across the 2 of their papers we have counts for
7 papers · 1 filter
The Shannon Upper Bound for the Error Exponent
Sergey Tridenski, Anelia Somekh-Baruch
For the discrete-time additive white generalized Gaussian noise channel with a generalized input power constraint, with the respective shape and power parameters >= 1, we derive an…
The Method of Types for the AWGN Channel
Sergey Tridenski, Anelia Somekh-Baruch
For the discrete-time AWGN channel with a power constraint, we give an alternative derivation of Shannon's sphere-packing upper bound on the optimal block error exponent and prove…
A Generalization of the DMC
Sergey Tridenski, Anelia Somekh-Baruch
We consider a generalization of the discrete memoryless channel, in which the channel probability distribution is replaced by a uniform distribution over clouds of channel output s…
Proof of Convergence for Correct-Decoding Exponent Computation
Sergey Tridenski, Anelia Somekh-Baruch, Ram Zamir
For a discrete memoryless channel with finite input and output alphabets, we prove convergence of a parametric family of iterative computations of the optimal correct-decoding expo…
Channel input adaptation via natural type selection
Sergey Tridenski, Ram Zamir
We consider a channel-independent decoder which is for i.i.d. random codes what the maximum mutual-information decoder is for constant composition codes. We show that this decoder…
Channel Input Adaptation via Natural Type Selection
Sergey Tridenski, Ram Zamir
For the model of communication through a discrete memoryless channel using i.i.d. random block codes, where the channel is changing slowly from block to block, we propose a stochas…