Loading...
conference paper
On source/channel codes of finite block length
2001
IEEE International Symposium on Information Theory
For certain fortunate choices of source/channel pairs, all sophisticated coding is in vain: for them, a code of block length one is sufficient to achieve optimal performance \cite{mgbrmvtrans}. Is the set of ``fortunate choices'' larger if we allow for codes of block length $M$? For a certain class of discrete memoryless source/channel pairs, we can prove that the answer is negative as long as $M$ is finite.
Loading...
Name
GastparRV01.pdf
Access type
openaccess
Size
96.59 KB
Format
Adobe PDF
Checksum (MD5)
a225dec8c6bbaf9fafd9d1d0463e5cca