Fixed-Length Codes for Discrete Channels

Definition (Fixed-Length Codes for Discrete Channels)

Given positive integers nn and MM, an (n,M)(n,M) fixed-length code for a discrete channel (X,Y,{PYnXn}n=1)(\mathcal{X},\mathcal{Y}, \{P_{Y^{n}|X^{n}}\}_{n=1}^{\infty}) with code length nn and rate Rn:=1nlog2MR_{n}:=\frac{1}{n}\log_{2}M message bits/channel use consists of:

  • a message set M={1,,M}\mathcal{M}=\{1,\cdots,M\} intended for transmission
  • an encoding function f:MXnf:\mathcal{M}\to\mathcal{X}^{n}yielding codewords f(1),,f(M)Xnf(1),\cdots,f(M)\in\mathcal{X}^{n} of length nn. The set of codewords is called the codebook, written as Cn={f(1),,f(M)}\mathcal{C}_{n}=\{f(1),\cdots,f(M)\}
  • a decoding function g:YnMg:\mathcal{Y}^{n}\to\mathcal{M}

Definition (Average probability of error)

Given a (n,M)(n,M) code Cn\mathcal{C}_{n}, its average probability of error is given by Pe(Cn):=P(W^W)=w=1MP(W=w)P(g(ynwW=w))=1Mw=1Mλw(Cn)\begin{align*} P_e(\mathcal{C}_n):&=P(\hat W\not=W)\\ &=\sum\limits_{w=1}^{M}P(W=w)P(g(y^{n}\not=w|W=w))\\ &=\frac{1}{M}\sum\limits^{M}_{w=1}\lambda_{w}(\mathcal{C}_{n}) \end{align*}where λw(Cn):=P(g(yn)wW=w))=P(g(yn)wXn=f(w))=ynYn:g(ynw)PYnXn(ynxn)\begin{align*} \lambda_{w}(\mathcal{C}_{n}):&=P(g(y^{n})\not=w|W=w))\\ &=P(g(y^{n})\not=w|X^{n}=f(w))\\ &=\sum\limits_{y^{n}\in\mathcal{Y}^{n}:g(y^{n}\not=w)}P_{Y^{n}|X^{n}}(y^{n}|x^{n}) \end{align*}is the code’s conditional Probability of Decoding error given that the message ww is sent over the channel.

Linked from