Correcting combinations of errors and erasures with Euclidean geometry LDPC codes
Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled Abdel-Ghaffar · 2013
It is shown that Euclidean geometry LDPC codes in conjunction with their shortened codes obtained by puncturing their parity-check matrices are effective in correcting combinations of errors and erasures with a two-phase decoding scheme. This is due to the large row redundancies of the parity-check matrices of these codes which are given by the incidence matrices of Euclidean geometries.