On source/channel codes of finite block length

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.


Published in:
IEEE International Symposium on Information Theory, 261
Presented at:
ISIT 2001, Washington DC, US, 24-29 June 2001
Year:
2001
Keywords:
Laboratories:




 Record created 2005-04-18, last modified 2018-03-18

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)