We provide another proof to the EL Theorem. We show the tradeoff between compressibility of codebooks and their communication capacity. A resource bounded version of the EL Theorem is proven. This is used to prove three instances of resource bounded derandomization. This paper is in support of the general claim that if the existence of an object can be proven with the probabilistic method, then bounds on its Kolmogorov complexity can be proven as well.

翻译：我们给出了EL定理的另一种证明。我们展示了编码本的可压缩性与其通信容量之间的权衡。证明了EL定理的资源有界版本，并利用该结果证明了三个资源有界去随机化的实例。本文支持一个普遍论断：若能用概率方法证明某个对象的存在性，则也能证明其柯尔莫哥洛夫复杂度的上界。