  This paper introduces a new inequality in algorithmic information theory that
can be seen as an extended coding theorem. This inequality has applications in
new bounds between quantum complexity measures.
