1. Babai, L., Fortnow L., Levin, L.A., Szegedy M. Checking computations in polylogarithmic time, in Proc. of the 23rd Annual Symp. on Theory of Computing, 21–31, 1991.
2. Berelekamp, E.R. Algebraic Coding Theory. New York: McGraw-Hill, 1968.
3. Blum, M. and Micali, S. How to generate cryptographically strong sequences of pseudorandom bits. IEEE FOCS 23, 112–117, 1982.
4. Diffie, W. and Hellman, M.E. New directions in cryptography. IEEE Trans. Info. Theory 22, 644–654, 1976.
5. Lipton, R. On Coding for Noisy Feasible Channels, unpublished manuscript, 1993.