Information Theory and Reliable Communication
Information Theory and Reliable Communication
Parallel error correcting codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The cutoff rate of a discrete memoryless channel (DMC) $W:{\cal X} \longrightarrow {\cal Y}$ is defined as $R_0(W) = \max_Q -\log \sum\limits_{y \in {\cal Y}} \left[ \sum\limits_{x \in {\cal X}} Q(x) \sqrt{W(y|x)}\right]^2$ where the maximum is over all probability distributions on ${\cal X}$. This parameter serves as a figure of merit for coding applications. There is also a decoding algorithm known as 'sequential decoding' that can readily achieve rates up to R0.