Files

Action Filename Description Size Access License Resource Version
Show more files...

Abstract

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.

Details

Actions

Preview