Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes

抄録

Based on the codewords of the [q,2,q-1] extended Reed-Solomon (RS) code over the finite field F_q, we can construct a regular binary γq×q² matrix H(γ,q), where q is a power of 2 and γ≤q. The matrix H(γ,q) defines a regular low-density parity-check (LDPC) code C(γ,q), called a full-length RS-LDPC code. Using some analytical methods, we completely determine the values of s(H(4,q)), s(H(5,q)), and d(C(5,q)) in this letter, where s(H(γ,q)) and d(C(γ,q)) are the stopping distance of H(γ,q) and the minimum distance of C(γ,q), respectively.