1. Arıkan E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binaryinput memoryless channels. IEEE Trans. Inf. Theory 55(7), 3051–3073 (2009).
2. Assmus Jr E.F., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992).
3. Bruen A.: Blocking sets and low-weight codewords in the generalized reed-muller codes. In: Bruen A., Wehlau D., Society C.M. (eds.) Error-Correcting Codes, Finite Geometries, and Cryptography. Contemporary Mathematics, vol. 525. American Mathematical Society, Southport, pp. 161–164 (2010).
4. Burnashev M., Dumer I.: Error exponents for recursive decoding of Reed–Muller codes on a binary-symmetric channel. IEEE Trans. Inf. Theory 52(11), 4880–4891 (2006).
5. Cameron P.J., Von Lint J.H.: Graph Theory, Coding Theory and Block Designs. London Mathematical Society. Lecture Note, vol. 19. Cambridge University Press, London (1975).