  In article present measure code distance algorithm of binary and ternary
linear block code using block Korkin-Zolotarev (BKZ). Proved the upper bound on
scaling constant for measure code distance of non-systematic linear block code
using BKZ-method for different value of the block size. Introduced method show
linear decrease of runtime from number of threads and work especially good
under not dense lattices of LDPC-code. These properties allow use this
algorithm to measure the minimal distance of code with length several thousand.
The algorithm can further improve by transform into probabilistic algorithm
using lattice enumerating pruning techniques
