Title :
Approximate algorithms for computing the minimum distance of low-density parity-check codes
Author :
Hu, Xiao Yu ; Fossorier, Marc P C ; Eleftheriou, Evangelos
Author_Institution :
IBM Zurich Res. Lab., Ruschlikon, Switzerland
fDate :
27 June-2 July 2004
Abstract :
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.
Keywords :
geometric codes; parity check codes; randomised algorithms; Gallager-type codes; finite-geometry-type codes; low-density parity-check codes; minimum distance; nearest nonzero codewords search; randomized approximate algorithms; Electronic mail; Error correction codes; Hamming distance; Hamming weight; Iterative decoding; Laboratories; Linear code; NP-hard problem; Parity check codes; Turbo codes;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365512
