1. Gallager, R.G., Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963. Translated under the title Kody s maloi plotnost’yu proverok na chetnost’, Moscow: Mir, 1966.
2. Tanner, R.M., A Recursive Approach to Low Complexity Codes, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 5, pp. 533–547.
3. Zyablov, V.V. and Pinsker, M.S., Decoding Complexity of Low-Density Codes for Transmission in a Channel with Erasures, Probl. Peredachi Inf., 1974, vol. 10, no. 1, pp. 15–28 [Probl. Inf. Trans. (Engl. Transl.), 1974, vol. 10, no. 1, pp. 10–21].
4. Zigangirov, D.K. and Zigangirov, K.Sh., Decoding of Low-Density Codes with Parity-Check Matrices Composed of Permutation Matrices in an Erasure Channel Probl. Peredachi Inf., 2006, vol. 42, no. 2, pp. 44–52 [Probl. Inf. Trans. (Engl. Transl.), 2006, vol. 42, no. 2, pp. 106–113].
5. Luby, M.G., Mitzenmacher, M., Shokrollahi, M.A., and Spielman, D.A., Efficient Erasure Correcting Codes, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 2, pp. 569–584.