Searching the Minimum Distances of LDPC Codes
To find the minimum distance computation of LDPC codes is a NP problem, there has been no simple way to obtain the minimum distance of LDPC codes because of the code length being very long. To provide a solution to deal with this hard problem, this paper develops an algorithm to estimate the weights and distance of LDPC codes based on generator matrices. The paper establishes the upper bounds of weights and distances of LDPC codes by using the vectors of generator matrices, which is different from the existed probabilitistic search methods for the weights’ and distances of LCPC codes. The proposed algorithm can greatly reduce the searching time of weights and distances. Applying the algorithm we can obtain some LDPC codes of great distances and being free girth 4. Simulations verify the algorithms to be valid.
Codes LDPC coding distance bounds weights bounds
Yang Xiao Kiseon Kim
1Institute of Information Science,Beijing Jiaotong University Beijing 100044,China Dept.of Information and Communications Gwangju Institute of Science and Technology Gwangju 500-712,K
国际会议
The IET 2nd International Conference on Wireless,Mobile & Multimedia Networks(第二届IET国际无线移动多媒体网络会议)
北京
英文
2008-10-12（万方平台首次上网日期，不代表论文的发表时间）