1. Alekhnovich, M.: More on average case vs approximation complexity. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 11–14 October 2003, Cambridge, MA, USA, pp. 298–307. IEEE Computer Society (2003)
2. Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economical construction of the transitive closure of a directed graph. Sov. Math. Dokl. 11, 1209–1210 (1970)
3. Baicheva, T.S., Bouyukliev, I., Dodunekov, S.M., Fack, V.: Binary and ternary linear quasi-perfect codes with small dimensions. IEEE Trans. Inf. Theory 54(9), 4335–4339 (2008)
4. Bernstein, D.J.: Optimizing linear maps modulo 2.
http://binary.cr.yp.to/linearmod2-20090830.pdf
5. Lecture Notes in Computer Science;DJ Bernstein,2013