On the lower bound of the free distance of partial unit memory codes based on LDPC Codes

K. A. Kondrashov, Victor Zyablov · 2011

In this paper we describe ensemble of binary partial unit memory (PUM) codes based on Low-Density Parity-Check (LDPC) block codes. We study the lower bound on the free distance of the proposed codes and show that the increase α of these codes has positive value.

Read the paper · More papers on PaperTik