When <math>C</math> is a binary blockcodeblock code, consisting of <math>A</math> codewords of length ''n'' bits, then the Informationinformation rate of <math>C</math> is defined as: <math>\frac{\!^{2}log(A)}{n}</math>. When f.i. the first ''k'' bits of a codeword are independent informationbits, then the information rate is: <math>\frac{\!^{2}log(2^k)}{n}=\frac{k}{n}</math>.