Skip to main content
Christian Chapman's user avatar
Christian Chapman's user avatar
Christian Chapman's user avatar
Christian Chapman
  • Member for 14 years, 1 month
  • Last seen this week
revised
Backwards random codebook generation
added 7 characters in body
Loading…
comment
Increase mutual information for binary symmetric channel
This is much more lucidly stated as follows: $${}$$ We have $N$ sources $X=[X_1,\dots,X_N]^T$ where the $X_n$ are independent and $X_n\sim B(\alpha_n)$. We use a binary linear transformation $B:\{0,1\}^N\to\{0,1\}^K$ to form an input $Y:=BX$. We put $Y$ through $K$ independent binary symmetric channels $P(Z_k|Y_k)$ each with parameter $\beta_k$, to produce an output $Z=[Z_1,\dots,Z_K]^T$. What choice of $B$ maximizes $I(X;Z)?$
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
Loading…
revised
Loading…
revised
Loading…
revised
Backwards random codebook generation
added 48 characters in body
Loading…
revised
Backwards random codebook generation
deleted 5 characters in body
Loading…
comment
Backwards random codebook generation
It came up when trying to find the information capacity of a situation where one transmitter is broadcasting to a collection of receivers that can't see each other's receptions directly, but can only conference a certain amount of information to all the others.
revised
Backwards random codebook generation
added 86 characters in body
Loading…
revised
Backwards random codebook generation
added 27 characters in body
Loading…
revised
Loading…
1
9
10
11 12 13