Infoscience

Conference paper

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.

    Keywords: NCCR-MICS/CL1 ; NCCR-MICS

    Reference

    • LCAV-CONF-2001-006

    Record created on 2005-04-18, modified on 2016-08-08

Related material