On the information function of an error-correcting code
Tor Helleseth, Torleiv Kløve, V.I. Levenshtein · IEEE Transactions on Information Theory · 1997
The information function e/sub h/ of a code is the average amount of information contained in h positions of the codewords. Upper and lower bounds on the information function of binary linear codes are given. The average value and variance of the information function over all [n, k] codes are determined,.