Approximate algorithms for computing the minimum distance of low-density parity-check codes
Xiaoyu Hu, M.P.C. Fossorier, Evangelos S. Eleftheriou · 2004
We propose a family of randomized approximate algorithms, called nearest nonzero codewords search (NNCS), for computing the minimum distance of low-density parity-check (LDPC) codes, including Gallager-type and finite-geometry-type codes.