Computer Science – Information Theory
Scientific paper
2005-08-04
Computer Science
Information Theory
5 pages, 7 figures, 2005 IEEE International Symposium on Information Theory, Adelaide, Sept. 4-9, 2005
Scientific paper
The cutoff rate $R_0(W)$ of a discrete memoryless channel (DMC) $W$ is often used as a figure of merit, alongside the channel capacity $C(W)$. Given a channel $W$ consisting of two possibly correlated subchannels $W_1$, $W_2$, the capacity function always satisfies $C(W_1)+C(W_2) \le C(W)$, while there are examples for which $R_0(W_1)+R_0(W_2) > R_0(W)$. This fact that cutoff rate can be ``created'' by channel splitting was noticed by Massey in his study of an optical modulation system modeled as a $M$'ary erasure channel. This paper demonstrates that similar gains in cutoff rate can be achieved for general DMC's by methods of channel combining and splitting. Relation of the proposed method to Pinsker's early work on cutoff rate improvement and to Imai-Hirakawa multi-level coding are also discussed.
No associations
LandOfFree
Channel combining and splitting for cutoff rate improvement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Channel combining and splitting for cutoff rate improvement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Channel combining and splitting for cutoff rate improvement will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-614148