低密度奇偶校验码(LDPC)是一种优秀的线性分组奇偶校验码。在简要阐述LDPC码原理上,给出了一种叫"最小码字搜索法"的算法来估算LDPC码的最小汉明距离。并用相应的实例给予验证,显示了该方法的正确性与实用性,对分析与优化LDPC码设计具有重要参考价值。Low-density parity-check (LDPC) codes are a good liner block parity codes. In this paper, the fundamental of LDPC codes are introduced briefly first. Then an algorithm called the minimum-weight codeword searching is discussed, which can be used to compute the minimum distance of LDPC codes. The effectiveness and the practicability of the algorithm are demonstrated by some examples. It is significant for us to analyze and optimize the design of LDPC codes.国家"863"计划项目(2001AA123061);; 国家自然科学基金项目(60272005)资
