GPU_implemetation_of_Tanner_lower_bound

Matlab GPU/CPU implementation for Fundamental Tanner lower bound estimation on code distance (both codewords and TS pseudocodewords). Estimate lower bound of code distance and heuristics optimization second_eigen/first_eigen to choice best code in ensemble, very fast sieving from code distance, especialy important for low rate codes as Vontobel proof it tight bound to Trapping Sets pseudocodewords weight too. Tanner R. M. (2001) ‘Minimum distance bounds by graph analysis’, IEEE-IT, Vol. 47, pp. 808-821. For answear why TS pseudocodewords read Vontobel, R Koetter Lower bounds on the minimum pseudoweight of linear codes. Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on This works answear on question "Why Loopy BP wook?" from graph probabalistical model under example of LDPC codes. Give good heuristics on sieving of code in one ensemble (family) using spectral theory (Expanders)