Computing the minimum distance of nonbinary LDPC codes using block KorkinZolotarev method
Abstract
In article present measure code distance algorithm of binary and ternary linear block code using block KorkinZolotarev (BKZ). Proved the upper bound on scaling constant for measure code distance of nonsystematic linear block code using BKZmethod 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 LDPCcode. 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
 Publication:

arXiv eprints
 Pub Date:
 October 2015
 DOI:
 10.48550/arXiv.1511.00125
 arXiv:
 arXiv:1511.00125
 Bibcode:
 2015arXiv151100125U
 Keywords:

 Computer Science  Information Theory
 EPrint:
 14 pages, 2 tables, in Russian